Applications of infinitary lambda calculus

We present an introduction to infinitary lambda calculus, highlighting its main properties. Subsequently we give three applications of infinitary lambda calculus. The first addresses the non-definability of Surjective Pairing, which was shown by the first author not to be definable in lambda calculus. We show how this result follows easily as an application of Berry's Sequentiality Theorem, which itself can be proved in the setting of infinitary lambda calculus. The second pertains to the notion of relative recursiveness of number-theoretic functions. The third application concerns an explanation of counterexamples to confluence of lambda calculus extended with non-left-linear reduction rules: Adding non-left-linear reduction rules such as @dxx->x or the reduction rules for Surjective Pairing to the lambda calculus yields non-confluence, as proved by the second author. We discuss how an extension to the infinitary lambda calculus, where Bohm trees can be directly manipulated as infinite terms, yields a more simple and intuitive explanation of the correctness of these Church-Rosser counterexamples.

[1]  S. C. Kleene,et al.  Recursive functionals and quantifiers of finite types. II , 1959 .

[2]  Jan Willem Klop,et al.  Transfinite Reductions in Orthogonal Term Rewriting Systems , 1995, Inf. Comput..

[3]  Alessandro Berarducci,et al.  Innite -calculus and non-sensible models , 1994 .

[4]  Richard Statman,et al.  Applications of Plotkin-terms: partitions and morphisms for closed terms , 1999, Journal of Functional Programming.

[5]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

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

[7]  Jörg Endrullis,et al.  Reduction Under Substitution , 2008, RTA.

[8]  Dana S. Scott,et al.  Some philosophical issues concerning theories of combinators , 1975, Lambda-Calculus and Computer Science Theory.

[9]  C.-H. Luke Ong,et al.  Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..

[10]  Dov M. Gabbay,et al.  Background : computational structures , 1992 .

[11]  Jakob Grue Simonsen,et al.  Infinitary Combinatory Reduction Systems , 2005, Inf. Comput..

[12]  Zena M. Ariola,et al.  Equational Term Graph Rewriting , 1996, Fundam. Informaticae.

[13]  Artur S. d'Avila Garcez,et al.  We Will Show Them! Essays in Honour of Dov Gabbay, Volume One , 2005, We Will Show Them!.

[14]  Jan Willem Klop,et al.  Infinitary Lambda Calculus , 1997, Theoretical Computer Science.

[15]  Terese Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.

[16]  H. Barendregt The type free lambda calculus , 1977 .

[17]  Zena M. Ariola,et al.  Lambda Calculus with Explicit Recursion , 1997, Inf. Comput..

[18]  Paula Severi,et al.  Infinitary Rewriting: From Syntax to Semantics , 2005, Processes, Terms and Cycles.

[19]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[20]  Jan Willem Klop,et al.  Infinitary Lambda Calculi and Böhm Models , 1995, RTA.

[21]  Jan Willem Klop,et al.  On the adequacy of graph rewriting for simulating term rewriting , 1994, TOPL.

[22]  Giuseppe Longo,et al.  Set-theoretical models of λ-calculus: theories, expansions, isomorphisms , 1983, Ann. Pure Appl. Log..

[23]  H. Barendregt Pairing without conventional restraints , 1974 .

[24]  Benedetto Intrigila,et al.  Non-existent Statman's Double Fixedpoint Combinator Does Not Exist, Indeed , 1997, Inf. Comput..

[25]  Jonathan P. Seldin Review: Corrado Bohm, Wolf Gross, E. R. Caianiello, Introduction to the CUCH; C. Bohm, T. B. Steel, The CUCH as a Formal and Description Language , 1975 .

[26]  Stefan Kahrs,et al.  Infinitary rewriting: meta-theory and convergence , 2007, Acta Informatica.

[27]  Jan Willem Klop,et al.  Descendants and Origins in Term Rewriting , 2000, Inf. Comput..

[28]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[29]  Zena M. Ariola,et al.  Cyclic lambda graph rewriting , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[30]  Jan Willem Klop,et al.  Term Graph Rewriting , 1995, HOA.

[31]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[32]  Mark J. van der Laan,et al.  The Open Problem , 2011 .

[33]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.