A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types

DOI10.1007/978-3-642-04081-8_7zbMath1254.03021OpenAlexW1547078458MaRDI QIDQ3184667

Maria Grazia Vigliotti, Steffen van Bakel

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_7

Mathematics Subject Classification ID

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

Related Items

Symmetries and Dualities in Name-Passing Process Calculi ⋮ Linear Lambda Calculus and Deep Inference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong normalisation in the \(\pi\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Needed reduction and spine strategies for the lambda calculus
• Proofs as processes
• On the \(\pi\)-calculus and linear logic
• On reduction-based process semantics
• Untersuchungen über das logische Schliessen. I
• Computation with classical sequents
• Theoretical Computer Science