Functions as processes: termination and the λµµ-calculus

Authors:
Matteo Cimini;Claudio Sacerdoti Coen;Davide Sangiorgi
Affiliations:
School of Computer Science, Reykjavik University, Iceland;Department of Computer Science, University of Bologna, Italy;Department of Computer Science, University of Bologna, Italy and INRIA, France
Venue:
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Year:
2010

Citing 16
Cited 0

Proofs and types

Proofs and types
A calculus of mobile processes, I

Information and Computation
The duality of computation

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Functions as Processes

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Internal Mobility and Agent-Passing Calculi

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Internal Mobility and Agent-Passing Calculi

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
From λ to π; or, Rediscovering continuations

Mathematical Structures in Computer Science
Lambda and pi calculi, CAM and SECD machines

Journal of Functional Programming
Termination of processes

Mathematical Structures in Computer Science
Ensuring termination by typability

Information and Computation
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)

Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
Mobile processes and termination

Semantics and algebraic specification

Quantified Score

Hi-index	0.00

Visualization

Abstract

The λµµ-calculus is a variant of the λ-calculus with significant differences, including non-confluence and a Curry-Howard isomorphism with the classical sequent calculus. We present an encoding of the λµµ-calculus into the π-calculus. We establish the operational correctness of the encoding, and then we extract from it an abstract machine for the λµµ-calculus. We prove that there is a tight relationship between such a machine and Curien and Herbelin's abstract machine for the λµµ-calculus. The π-calculus image of the (typed) λµµ-calculus is a nontrivial set of terminating processes.