Algorithmic type checking for a pi-calculus with name matching and session types

DOI10.1016/j.jlap.2013.05.003zbMath1283.68127OpenAlexW2023274662MaRDI QIDQ2436508

Marco Giunti

Publication date: 25 February 2014

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2013.05.003

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Unnamed Item

Cites Work

• Amalgamating sessions and methods in object-oriented languages with generics
• Objects and session types
• On reduction-based process semantics
• Subtyping for session types in the pi calculus
• Towards Static Deadlock Resolution in the $$\pi $$-Calculus
• A Distributed Pi-Calculus
• A Linear Account of Session Types in the Pi Calculus
• Linear type theory for asynchronous session types
• Modular session types for distributed object-oriented programming
• Higher-Order Processes, Functions, and Sessions: A Monadic Integration
• Linearity, session types and the Pi calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic type checking for a pi-calculus with name matching and session types