The m-calculus

DOI10.1145/604131.604136zbMath1321.68365OpenAlexW2068983796MaRDI QIDQ2942912

Alan Schmitt, Jean-Bernard Stefani

Publication date: 11 September 2015

Published in: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/604131.604136

zbMATH Keywords

distributionmobilitytype systemsprocess calculihigher order

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Reversibility in the higher-order \(\pi\)-calculus ⋮ Abstractions for fault-tolerant global computing ⋮ Type-safe higher-order channels with channel locality ⋮ Basic observables for a calculus for global computing ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Characterizing contextual equivalence in calculi with passivation ⋮ safeDpi: a language for controlling mobile code

Uses Software

• TREX

Cites Work

• Regular expression pattern matching for XML
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The m-calculus