A syntactical proof of the operational equivalence of two λ-terms

Theoretical Computer Science

Volumn 180, Issue 1-2, 1997, Pages 371-375

  David, René ^a   Nour, Karim ^a  

^a Institut Universitaire de France   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; TREES (MATHEMATICS); TURING MACHINES;

BOHM TREE; SYNTACTICAL PROOF;

THEOREM PROVING;

EID: 0031162482     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00004-2     Document Type: Article

References (3)

1. H. Barendregt, The Lambda Calculus, its Syntax and Semantics (North-Holland, Amsterdam, 1984).
2. R. David and K. Nour, Storage operators and directed lambda calculus, J. Symbolic Logic 60 (1995) 1054-1086.
3. J. Hyland, A syntactic characterization of the equality in some models of the lambda calculus, J. London Math. Soc. (2) 12 (1976) 361-370.