The reflective higher-order calculus: encodability, typability and separation

DOI10.1016/j.ic.2024.105138OpenAlexW4390811171WikidataQ130023114 ScholiaQ130023114MaRDI QIDQ6124241

Stian Lybech

Publication date: 27 March 2024

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2024.105138

zbMATH Keywords

reflectionseparationtype system\(\pi\)-calculusencoding\(\rho\)-calculus

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to abstract syntax with variable binding
• A calculus of mobile processes. I
• A syntactic approach to type soundness
• A theory of encodings and expressiveness (extended abstract)
• Towards a unified approach to encodability and separation results for process calculi
• Psi-calculi: a framework for mobile processes with nominal data and logic
• From π-calculus to higher-order π-calculus — and back
• Higher-order psi-calculi
• Full abstraction for expressiveness: history, myths and facts