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

DOI10.1007/3-540-56610-4_62MaRDI QIDQ5044732zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Asynchronous process calculi: The first- and higher-order paradigms
• A calculus of mobile processes. I
• On mobility and communication
• Distinguishing and relating higher-order and first-order processes by expressiveness
• First-order reasoning for higher-order concurrency

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4104403 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A calculus of mobile processes. I
• Barbed bisimulation
• Denotational semantics of a parallel object-oriented language
• Functions as processes
• Issues in the design of a parallel object-oriented language
• Refusal testing
• Testing equivalences for processes

Cited in

(25)

• A fully abstract denotational semantics for the calculus of higher-order communicating systems
• A CPS encoding of name-passing in higher-order mobile embedded resources
• A semantic theory for value-passing processes based on the late approach
• A generic type system for higher-order \(\Psi\)-calculi
• A simple calculus for proteins and cells
• A functional presentation of pi calculus
• scientific article; zbMATH DE number 1759486 (Why is no real title available?)
• Partial confluence of processes and systems of objects
• On the validity of encodings of the synchronous in the asynchronous -calculus
• On the decidability of process equivalences for the \(\pi\)-calculus
• Sorting realization of well-ordered sets based on \(\pi\)-calculus
• First-order reasoning for higher-order concurrency
• Decoding choice encodings
• A generic type system for higher-order \(\Psi\)-calculi
• Expressiveness of process algebras
• A thesis for interaction
• On the relative expressiveness of higher-order session processes
• A reflective higher-order calculus
• Encodability and separation for a reflective higher-order calculus
• Distinguishing and relating higher-order and first-order processes by expressiveness
• scientific article; zbMATH DE number 7204939 (Why is no real title available?)
• Variations on mobile processes
• A CPS encoding of name-passing in higher-order mobile embedded resources
• The reflective higher-order calculus: encodability, typability and separation
• Theory of interaction

Describes a project that uses

Uses Software

• LOTOS

This page was built for publication: From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back

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