Encodability and separation for a reflective higher-order calculus

arXiv2209.02356MaRDI QIDQ6190870FDOQ6190870

Authors: Stian Lybech 

Publication date: 6 February 2024

Full work available at URL: https://arxiv.org/abs/2209.02356

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

Mathematics Subject Classification ID

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

Cites Work

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

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)