Computing with Böhm trees

Fundamenta Informaticae

Volumn 45, Issue 1-2, 2001, Pages 53-77

  David, René ^a  

^a Laboratoire de Maths Camp Sci   (France)

Author keywords

calculus, B hm trees; Decoration; Head reduction; Operational equivalence

Indexed keywords

EID: 0039147937     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Amadio, R., Curien, P. L.: Domains and Lambda-Calculi, Cambridge University Press, 1998.
2. Barendregt, H. P.: The Lambda-Calculus, its syntax and semantics, North-Holland (1984).
3. Berarducci, A.: Infinite λ-calculus and non-sensible models, in Logic and Algebra, ed. A. Ursini & P. Agliano, Lecture Notes in Pure and Applied Mathematics 180, Marcel Dekker Inc., 1996.
4. Coppo, M., Dezani-Ciancaglini, M., Ronchi, S.: Della Rocca, Semi-separability of finite sets of terms in Scott's D∞-models of λ-calculus, in Lecture Notes in Computer Science 62, p 142-164 (1978).
5. David, R.: Every unsolvable λ term has a decoration, Typed Lambda Calculi and Applications (TLCA'99), Lecture Notes in Computer Science 1581, p 98-113.
6. David, R., Nour, K.: A syntactical proof of the operational equivalence of two λ-terms, Theoritical Computer Science 180 (1997) p 371-375.
7. David, R., Nour, K.: Storage operators and directed lambda-calculus, Journal of Symbolic Logic 60 (4) p 1054-1086 (1995).
8. Kerth, R.: Isomorphisme et équivalence équationnelle entre modèles du λ calcul Ph.D. thesis Université Paris 7, 1995.
9. Kerth, R. : The interpretation of Unsolvable λ Terms in Models of Untyped λ Calculus. To appear in the JSL
10. Kerth, R.: On the Construction of Stable Models of Untyped λ Calculus . To appear in TCS
11. Hyland, M.: A syntactic characterization of the equality in some models for the Lambda-Calculus, Journal of the London Mathematical Society 12 (2), p 361-370, 1976.
12. Krivine, J.L.: Lambda-Calcul, Types et modèles, Masson, Paris (1990).
13. Wadsworth, C., P.: The relation between computational and denotational properties for Scott's D∞-models of λ-calculus, SIAM Journal of Computing 5 (3), p 488-521, 1976.