Bounded Combinatory Logic and lower complexity

We introduce a stratified version of Combinatory Logic1 in which there are two classes of terms called player and opponent such that the class of player terms is strictly contained in the class of opponent terms. We show that the system characterizes Polynomial Time in a similar way to Soft Linear Logic. With the addition of explicit "lazy" products to the player terms and various notions of distributivity, we obtain a characterization of Polynomial Space. This paper is an expanded version of the abstract presented at DICE 2013.

[1]  Vincent Danos,et al.  Linear logic and elementary time , 2003, Inf. Comput..

[2]  Stephen A. Cook,et al.  A new recursion-theoretic characterization of the polytime functions , 1992, STOC '92.

[3]  Andreas Goerdt.  Characterizing complexity classes by higher type primitive recursive definitions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[4]  Kazushige Terui.  Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus , 2012, RTA.

[5]  Daniel Leivant,et al.  Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity , 1999, Ann. Pure Appl. Log..

[6]  Martin Hofmann,et al.  Linear types and non-size-increasing polynomial time computation , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[7]  Paris C. Kanellakis,et al.  On the expressive power of simply typed and let-polymorphic lambda calculi , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[8]  Neil D. Jones.  The expressive power of higher-order types or, life without CONS , 2001, J. Funct. Program..

[9]  Andreas Goerdt.  Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions , 1992, Theor. Comput. Sci..

[10]  Samson Abramsky,et al.  Geometry of Interaction and linear combinatory algebras , 2002, Mathematical Structures in Computer Science.

[11]  Luca Paolini,et al.  The Parametric Lambda-Calculus: a Metamodel for Computation , 2004 .

[12]  Stephen A. Cook,et al.  A new recursion-theoretic characterization of the polytime functions (extended abstract) , 1992, STOC '92.

[13]  Marco Gaboardi,et al.  A logical account of pspace , 2008, POPL '08.

[14]  Daniel Leivant,et al.  Stratified functional programs and computational complexity , 1993, POPL '93.

[15]  J. Robin B. Cockett,et al.  Safe recursion revisited I: Categorical semantics for lower complexity , 2014, Theor. Comput. Sci..

[16]  Marco Gaboardi,et al.  Soft Linear Logic and Polynomial Complexity Classes , 2007, LSFA.

[17]  Jean-Yves Girard.  Light Linear Logic , 1994, LCC.

[18]  Yves Lafont,et al.  Soft linear logic and polynomial time , 2004, Theor. Comput. Sci..

[19]  Yves Lafont.  Interaction Combinators , 1997, Inf. Comput..

[20]  Daniel Leivant,et al.  Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space , 1994, CSL.

[21]  J. Roger Hindley,et al.  Combinators and Lambda-Calculus , 1985, Combinators and Functional Programming Languages.

[22]  J. Robin B. Cockett,et al.  A Categorical Setting for Lower Complexity , 2010, MFPS.