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

We define a new, output-based encoding of the λ -calculus into the asynchronous η -calculus --- enriched with pairing --- that has its origin in mathematical logic, and show that this encoding respects one-step spine-reduction up to substitution, and that normal substitution is respected up to similarity. We will also show that it fully encodes lazy reduction of closed terms, in that term-substitution as well as each reduction step are modelled up to similarity. We then define a notion of type assignment for the η -calculus that uses the type constructor →, and show that all Curry-assignable types are preserved by the encoding.

[1]  G. Gentzen.  Untersuchungen über das logische Schließen. II , 1935 .

[2]  Frank Pfenning,et al.  Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.

[3]  Jean Goubault-Larrecq,et al.  A Few Remarks on SKInT , 1998 .

[4]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[5]  Gianluigi Bellin,et al.  On the pi-Calculus and Linear Logic , 1992, Theor. Comput. Sci..

[6]  Christian Urban,et al.  Strong Normalisation of Cut-Elimination in Classical Logic , 1999, Fundam. Informaticae.

[7]  Gerhard Gentzen,et al.  Investigations into Logical Deduction , 1970 .

[8]  Peter Sestoft.  Standard ML on the Web server: Visualizing Lambda Calculus Reduction , 1996 .

[9]  Hendrik Pieter Barendregt,et al.  Needed Reduction and Spine Strategies for the Lambda Calculus , 1987, Inf. Comput..

[10]  Steffen van Bakel,et al.  The Language X : Circuits, Computations and Classical Logic (Extended Abstract) , 2005 .

[11]  C. J. Bloo,et al.  Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection , 1995 .

[12]  Davide Sangiorgi,et al.  An Investigation into Functions as Processes , 1993, MFPS.

[13]  Hayo Thielecke,et al.  Categorical Structure of Continuation Passing Style , 1997 .

[14]  Samson Abramsky,et al.  Proofs as Processes , 1992, Theor. Comput. Sci..

[15]  Christian Urban.  Classical Logic and Computation , 2000 .

[16]  Davide Sangiorgi,et al.  Lazy functions and mobile processes , 2000, Proof, Language, and Interaction.

[17]  Steffen van Bakel,et al.  Computation with classical sequents , 2008, Math. Struct. Comput. Sci..

[18]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

[19]  S. Abramsky.  The lazy lambda calculus , 1990 .

[20]  Michel Parigot,et al.  Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.

[21]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[22]  Philip Wadler,et al.  A Syntax for Linear Logic , 1993, MFPS.

[23]  M. E. Szabo,et al.  The collected papers of Gerhard Gentzen , 1969 .

[24]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[25]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[26]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[27]  Steffen van Bakel,et al.  From X to π From X to π Representing the Classical Sequent Calculus in π-calculus , 2007 .

[28]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[29]  Alan P. Parkes.  Logic and Computation , 2002 .

[30]  Pierre America,et al.  ECOOP'91 European Conference on Object-Oriented Programming , 1991, Lecture Notes in Computer Science.

[31]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .