2010•Unpublished venueRequires access

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

Matteo Cimini, Claudio Sacerdoti Coen, Davide Sangiorgi

Open publisher page 2 citations

Abstract

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 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. 1

About this research paper

What this paper is about

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 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. 1

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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 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. 1

Key concepts: Calculus (dental), Cut-elimination theorem, Natural deduction, Sequent calculus, Correctness, Proof calculus, Time-scale calculus, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Functions as processes: termination and the λµµ-calculus — Research Paper | ScholarLens