Linear lambda calculus with explicit substitutions as proof-search in Deep Inference

SBV is a deep inference system that extends the set of logical operators of multiplicative linear logic with the non commutative operator seq. We introduce the logical system SBVr which extends SBV by adding a self-dual atom-renaming operator to it. We prove that the cut elimination holds on SBVr. SBVr and its cut free subsystem BVr are complete and sound with respect to linear Lambda calculus with explicit substitutions. Under any strategy, a sequence of evaluation steps of any linear � -term M becomes a process of proof-search in SBVr (BVr) once M is mapped into a formula of SBVr. Completeness and soundness follow from simulating linear� -reduction with explicit substitutions as processes. The role of the new renaming operator of SBVr is to rename channel-names on-demand. This simulates the substitution that occurs in a� -reduction. Despite SBVr is a minimal extension of SBV its proof-search can compute all boolean functions, as linear lambda calculus with explicit substitutio ns can compute all boolean functions as well. So, proof search of SBVr and BVr is at least ptime-complete.

[1]  Kai Brünnler.  Deep Inference and Its Normal Form of Derivations , 2006, CiE.

[2]  Alessio Guglielmi,et al.  A system of interaction and structure , 1999, TOCL.

[3]  P. Panangaden,et al.  The Logic BV and Quantum Causality , 2008 .

[4]  Kai Brünnler,et al.  Deep sequent systems for modal logic , 2009, Arch. Math. Log..

[5]  Pierre Lescanne.  From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. , 1994 .

[6]  Kai Brünnler,et al.  Atomic Cut Elimination for classical Logic , 2003, CSL.

[7]  Alwen Tiu,et al.  A System of Interaction and Structure II: The Need for Deep Inference , 2005, Log. Methods Comput. Sci..

[8]  Lutz Straßburger,et al.  MELL in the calculus of structures , 2003, Theor. Comput. Sci..

[9]  Lutz Straßburger,et al.  Non-commutativity and MELL in the Calculus of Structures , 2001, CSL.

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

[11]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[12]  Paola Bruscoli.  A Purely Logical Account of Sequentiality in Proof Search , 2002, ICLP.

[13]  Rajeev Goré,et al.  Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5 , 2007, J. Log. Comput..

[14]  Ozan Kahramanogullari.  System BV is NP-complete , 2008, Ann. Pure Appl. Log..

[15]  Lutz Straßburger,et al.  Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic , 2009, TLCA.

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

[17]  Paul-André Melliès.  Typed lambda-calculi with explicit substitutions may not terminate , 1995, TLCA.

[18]  Lutz Straßburger,et al.  Linear logic and noncommutativity in the calculus of structures , 2003 .

[19]  Lutz Straßburger.  System NEL is Undecidable , 2003, Electron. Notes Theor. Comput. Sci..

[20]  Pietro Di Gianantonio.  Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity , 2004, CSL.

[21]  Lutz Straßburger,et al.  A Non-commutative Extension of MELL , 2002, LPAR.

[22]  J. Girard,et al.  Proofs and types , 1989 .

[23]  Lutz Straßburger,et al.  A system of interaction and structure IV: The exponentials and decomposition , 2009, TOCL.

[24]  Harry G. Mairson.  Linear lambda calculus and PTIME-completeness , 2004, J. Funct. Program..

[25]  Kai Brünnler.  Cut Elimination inside a Deep Inference System for Classical Predicate Logic , 2006, Stud Logica.

[26]  Lutz Straßburger,et al.  A Local System for Linear Logic , 2002, LPAR.

[27]  Kai Brünnler.  Locality for Classical Logic , 2006, Notre Dame J. Formal Log..

[28]  Lutz Straßburger,et al.  A system of interaction and structure V: the exponentials and splitting , 2011, Math. Struct. Comput. Sci..

[29]  Phiniki Stouppa.  A Deep Inference System for the Modal Logic S5 , 2007, Stud Logica.

[30]  Alwen Tiu,et al.  A Local System for Classical Logic , 2001, LPAR.

[31]  Steffen van Bakel,et al.  A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types , 2009, CONCUR.

[32]  Alwen Tiu,et al.  A Local System for Intuitionistic Logic , 2006, LPAR.