From π-calculus to higher-order π-calculus — and back

DOI10.1007/3-540-56610-4_62zbMath1497.68351OpenAlexW2201760732MaRDI QIDQ5044732

Davide Sangiorgi

Publication date: 2 November 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-56610-4_62

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)

Related Items (16)

On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ On the decidability of process equivalences for the \(\pi\)-calculus ⋮ A semantic theory for value-passing processes based on the late approach ⋮ Theory of interaction ⋮ The reflective higher-order calculus: encodability, typability and separation ⋮ Variations on mobile processes ⋮ First-order reasoning for higher-order concurrency ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A simple calculus for proteins and cells ⋮ A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ Unnamed Item ⋮ A thesis for interaction ⋮ Partial confluence of processes and systems of objects ⋮ Decoding choice encodings ⋮ Expressiveness of Process Algebras

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refusal testing
• Issues in the design of a parallel object-oriented language
• Denotational semantics of a parallel object-oriented language
• A calculus of mobile processes. I
• Testing equivalences for processes
• Functions as processes
• Barbed bisimulation

This page was built for publication: From π-calculus to higher-order π-calculus — and back