Type inference for a distributed -calculus

DOI10.1007/3-540-36575-3_18MaRDI QIDQ4417898zbMATH OpenFDO

Authors Cédric Lhoussaine

Publication date 30 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2618/26180253.htm

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Type inference for a distributed \(\pi\)-calculus
• Global/local subtyping and capability inference for a distributed -calculus
• A Logic for Distributed Higher Order π-Calculus
• Distributive semantics for nondeterministic typed -calculi
• Bisimulations for a Distributed Higher Order π-Calculus
• A generic type system for the -calculus
• A generic type system for the pi-calculus
• Testing and Proving Distributed Algorithms in Constructive Type Theory
• Type-based information flow analysis for the \(\pi\)-calculus

Cited in

(11)

• Assigning types to processes
• Type inference for a distributed \(\pi\)-calculus
• safeDpi: a language for controlling mobile code
• Type-based information flow analysis for the \(\pi\)-calculus
• On hierarchical communication topologies in the -calculus
• Adding recursion to \textsc{Dpi} (extended abstract)
• Type reconstruction for the linear -calculus with composite regular types
• Placement Inference for a Client-Server Calculus
• Global/local subtyping and capability inference for a distributed -calculus
• Subtyping and locality in distributed higher order processes
• The receptive distributed -calculus. (Extended abstract)

This page was built for publication: Type inference for a distributed \(\pi\)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417898)