The M-calculus: a higher-order distributed process calculus
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 615137 (Why is no real title available?)
- scientific article; zbMATH DE number 1942450 (Why is no real title available?)
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 1953123 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Regular expression pattern matching for XML
- Types and programing languages
Cited in
(16)- Abstractions for fault-tolerant global computing
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Basic observables for a calculus for global computing
- safeDpi: a language for controlling mobile code
- Reversibility in the higher-order \(\pi\)-calculus
- A calculus of kells
- scientific article; zbMATH DE number 1361143 (Why is no real title available?)
- scientific article; zbMATH DE number 1088042 (Why is no real title available?)
- scientific article; zbMATH DE number 2090726 (Why is no real title available?)
- A distributed \(\pi\)-calculus with local areas of communication
- Type-safe higher-order channels with channel locality
- Global Computing
- The Kell calculus: operational semantics and type system.
- Characterizing contextual equivalence in calculi with passivation
- A taxonomy of process calculi for distribution and mobility
- On higher-order communication in ambient calculi
This page was built for publication: The M-calculus: a higher-order distributed process calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942912)