Skip to main content
×
Home
    • Aa
    • Aa

The infinitary lambda calculus of the infinite eta Böhm trees

  • PAULA SEVERI (a1) and FER-JAN DE VRIES (a1)
Abstract

In this paper, we introduce a strong form of eta reduction called etabang that we use to construct a confluent and normalising infinitary lambda calculus, of which the normal forms correspond to Barendregt's infinite eta Böhm trees. This new infinitary perspective on the set of infinite eta Böhm trees allows us to prove that the set of infinite eta Böhm trees is a model of the lambda calculus. The model is of interest because it has the same local structure as Scott's D -models, i.e. two finite lambda terms are equal in the infinite eta Böhm model if and only if they have the same interpretation in Scott's D -models.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

S. Abramsky and C.-H.L. Ong (1993). Full abstraction in the lazy lambda calculus. Information and Computation 105 (2) 159267.

S.v. Bakel , F. Barbanera , M. Dezani-Ciancaglini and F.J. de Vries (2002). Intersection types for λ-trees. Theoretical Computer Science 272 (1–2) 340.

M. Coppo , M. Dezani-Ciancaglini and M. Zacchi (1987). Type theories, normal forms, and D -lambda-models. Information and Computation 72 (2) 85116.

J.M.E. Hyland (1975). A survey of some useful partial order relations on terms of the lambda calculus. In: C. Böhm (ed.) Lambda Calculus and Computer Science Theory. vol. 37, Springer-Verlag Lecture Notes in Computer Science 8393.

J.R. Kennaway , J.W. Klop , M.R. Sleep and F.J. de Vries (1995b). Transfinite reductions in orthogonal term rewriting systems. Information and Computation 119 (1) 1838.

J.R. Kennaway , J.W. Klop , M.R. Sleep and F.J. de Vries (1997). Infinitary lambda calculus. Theoretical Computer Science 175 (1) 93125.

J.-J. Lévy (1976). An algebraic interpretation of the λβK-calculus, and an application of a labelled λ-calculus. Theoretical Computer Science 2 (1) 97114.

G. Longo (1983). Set-theoretical models of λ-calculus: Theories, expansions, isomorphisms. Annals of Pure and Applied Logic 24 (2) 153188.

P.G. Severi and F.J. de Vries (2005b). Order structures for Böhm-like models. In: Computer Science Logic, vol. 3634, Lecture Notes in Computer Science, Springer-Verlag 103116.

J.G. Simonsen (2004). On confluence and residuals in cauchy convergent transfinite rewriting. Information Processing Letters 91 (3) 141146.

C.P. Wadsworth (1976). The relation between computational and denotational properties for Scott's D -models of the lambda-calculus. SIAM Journal on Computing 5 (3) 488521.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 14 *
Loading metrics...

Abstract views

Total abstract views: 110 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th September 2017. This data will be updated every 24 hours.