scientific article; zbMATH DE number 1223739

zbMath0910.03019MaRDI QIDQ4219055

Davide Sangiorgi, Massimo Merro

Publication date: 15 November 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

process calculiasynchronous \(\pi\)-calculuscall-by-name \(\lambda\)-calculusJoin-calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (24)

Secrecy types for asymmetric communication. ⋮ Tau laws for pi calculus ⋮ Linear forwarders ⋮ Types and full abstraction for polyadic \(\pi\)-calculus ⋮ A functional presentation of pi calculus ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ Bisimulation congruence of \(\chi\)-calculus ⋮ A model of actors and grey failures ⋮ Linked data privacy ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Separation of synchronous and asynchronous communication via testing ⋮ On the Expressiveness of Pure Mobile Ambients ⋮ Unnamed Item ⋮ On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus ⋮ A calculus for reasoning about software composition ⋮ A hierarchy of equivalences for asynchronous calculi ⋮ Mobile objects as mobile processes ⋮ Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators ⋮ Bisimulations in the join-calculus ⋮ On modelling mobility ⋮ On the Expressive Power of Polyadic Synchronisation in π-calculus ⋮ Asynchronous process calculi: The first- and higher-order paradigms ⋮ Understanding the mismatch combinator in chi calculus ⋮ Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus

This page was built for publication: