Encodability and separation for a reflective higher-order calculus

MaRDI QIDQ6190870zbMATH OpenFDO

Authors Stian Lybech

Publication date 6 February 2024

Full work available at URL https://arxiv.org/abs/2209.02356, https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?EXPSOS22.6

Mathematics Subject Classification ID

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

Recommendations

• Reversibility in the higher-order \(\pi\)-calculus
• A reflective higher-order calculus
• From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
• A generic type system for higher-order \(\Psi\)-calculi
• Typed Lambda Calculi and Applications

Cites work

• scientific article; zbMATH DE number 2059568 (Why is no real title available?)
• scientific article; zbMATH DE number 2090726 (Why is no real title available?)
• A calculus of mobile processes. I
• A new approach to abstract syntax with variable binding
• A reflective higher-order calculus
• A theory of encodings and expressiveness (extended abstract)
• An introduction to the \(\pi\)-calculus.
• From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
• Full abstraction for expressiveness: history, myths and facts
• Higher-order psi-calculi
• On the expressive power of polyadic synchronisation in \(\pi \)-calculus
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Towards a unified approach to encodability and separation results for process calculi

This page was built for publication: Encodability and separation for a reflective higher-order calculus

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