Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture

The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between B\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal forms, equates two lambda-terms whenever their B\"ohm trees are equal up to countably many possibly infinite eta-expansions. Similarly, two lambda-terms are equal in Morris's original observational theory H+, generated by considering as observable the beta-normal forms, whenever their B\"ohm trees are equal up to countably many finite eta-expansions. The lambda-calculus also possesses a strong notion of extensionality called "the omega-rule", which has been the subject of many investigations. It is a longstanding open problem whether the equivalence B-omega obtained by closing the theory of B\"ohm trees under the omega-rule is strictly included in H+, as conjectured by Sall\'e in the seventies. In this paper we demonstrate that the two aforementioned theories actually coincide, thus disproving Sall\'e's conjecture. The proof technique we develop for proving the latter inclusion is general enough to provide as a byproduct a new characterization, based on bounded eta-expansions, of the least extensional equality between B\"ohm trees. Together, these results provide a taxonomy of the different degrees of extensionality in the theory of B\"ohm trees.

[1]  Giulio Manzonetto,et al.  A General Class of Models of H* , 2009, MFCS.

[2]  Giulio Manzonetto,et al.  Refutation of Sallé's Longstanding Conjecture , 2017, FSCD.

[3]  Richard Statman,et al.  The Omega Rule is Π11-Complete in the λβ-Calculus , 2009, Log. Methods Comput. Sci..

[4]  Andrew Polonsky Axiomatizing the Quote , 2011, CSL.

[5]  James H. Morris,et al.  Lambda-calculus models of programming languages. , 1969 .

[6]  Giulio Manzonetto,et al.  Relational Graph Models, Taylor Expansion and Extensionality , 2014, MFPS.

[7]  Christopher P. Wadsworth,et al.  The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..

[8]  M. Coppo Type theories, normal forms, and D?-lambda-models*1 , 1987 .

[9]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[10]  Torben Æ. Mogensen Efficient self-interpretation in lambda calculus , 1992, Journal of Functional Programming.

[11]  Giulio Manzonetto,et al.  Relational Graph Models at Work , 2017, Log. Methods Comput. Sci..

[12]  Paula Severi,et al.  An Extensional Böhm Model , 2002, RTA.

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

[14]  Pietro Di Gianantonio,et al.  Game Semantics for Untyped λβη-Calculus , 1999 .

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

[16]  Jens Palsberg,et al.  Breaking through the normalization barrier: a self-interpreter for f-omega , 2016, POPL.

[17]  Luca Paolini,et al.  Parametric λ-Theories , 2007 .

[18]  M. Coppo,et al.  Functional Characterization of Some Semantic Equalities inside Lambda-Calculus , 1979, ICALP.

[19]  Søren B. Lassen,et al.  Bisimulation in Untyped Lambda Calculus: Böhm Trees and Bisimulation up to Context , 1999, MFPS.

[20]  Jan A. Bergstra,et al.  Degrees of sensible lambda theories , 1978, Journal of Symbolic Logic.

[21]  P. Sallé Une extension de la theorie des types en λ-calcul , 1978 .

[22]  Thomas Given-Wilson,et al.  A combinatory account of internal structure , 2011, The Journal of Symbolic Logic.

[23]  Paula Severi,et al.  The infinitary lambda calculus of the infinite eta Böhm trees , 2017, Math. Struct. Comput. Sci..

[24]  Flavien Breuvart On the characterization of models of H , 2014, CSL-LICS.

[25]  Hendrik Pieter Barendregt,et al.  Some extensional term models for combinatory logics and l - calculi , 1971 .

[26]  A. Polonsky,et al.  New Results on Morris's Observational Theory , 2016 .

[27]  Alexandra Silva,et al.  Practical coinduction , 2016, Mathematical Structures in Computer Science.

[28]  Mariangiola Dezani-Ciancaglini,et al.  (Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus , 1978, ICALP.

[29]  Mariangiola Dezani-Ciancaglini,et al.  From Bohm's Theorem to Observational Equivalences: an Informal Account , 2001, BOTH.

[30]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.