scientific article; zbMATH DE number 7800868

arXiv2209.02354MaRDI QIDQ6150431

Stian Lybech, Unnamed Author, Hans Hüttel, Unnamed Author

Publication date: 6 February 2024

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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
• A new approach to abstract syntax with variable binding
• Termination in higher-order concurrent calculi
• A calculus for cryptographic protocols: The spi calculus
• Plain CHOCS. A second generation calculus for higher order processes
• Analysing input/output-capabilities of mobile processes with a generic type system
• Resource access control in systems of mobile agents
• A generic type system for the pi-calculus
• Towards a unified approach to encodability and separation results for process calculi
• Types for Resources in $$\psi $$-calculi
• On the Expressive Power of Polyadic Synchronisation in π-calculus
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Typed ψ-calculi
• Binary Session Types for Psi-Calculi
• From π-calculus to higher-order π-calculus — and back
• Higher-order psi-calculi

This page was built for publication: