Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context

Electronic Notes in Theoretical Computer Science

Volumn 20, Issue , 1999, Pages 346-374

  Lassen, S B ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; SEMANTICS; THEOREM PROVING;

BISIMULATION; BÖHM TREES; LAZY TREE THEORIES; UNTYPED LAMBDA CALCULUS;

TREES (MATHEMATICS);

EID: 19344377681     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80083-5     Document Type: Conference Paper

References (23)

1. Abramsky S. The lazy lambda calculus. Turner D. Research Topics in Functional Programming. 1990;65-116 Addison-Wesley
2. Abramsky S., Ong C.H.L. Full abstraction in the lazy lambda calculus. Information and Computation. 105:1993;150-267
3. Barendregt H.P. The Lambda Calculus: Its Syntax and Semantics. Number 103 in Studies in Logic and the Foundations of Mathematics. 1984;North-Holland. revised edition
4. G. Berry, "Modèles complètement adéquats et stables des lambda calculus typés," Thèse de doctorat d'etat, Université Paris VII, 1979.
5. G. Boudol, On the semantics of the call-b-name CPS transform, Theoretical Computer Science, 1999, Note, To appear.
6. David R., Nour K. A syntactical proof of the operational equivalence of two λ-terms. Theoretical Computer Science. 189:1997;371-375
7. M. Dezani-Ciancaglini, J. Tiuryn, and P. Urzyczyn, Discrimination by parallel observers, In: Proc. 12th Annual IEEE Symposium on Logic in Computer Science, 1997, pages 396-407.
8. H. Goguen, Soundness of typed operational semantics for the logical framework, In: Proc. 4th International Conference on Typed Lambda Calculus and Applications, L'Aquila, Italy, Lecture Notes in Computer Science 1581 (1999), Sprinter-Verlag.
9. A. D. Gordon, Bisimilarily as a theory of functional programming, In: Proc. 11th Conference of Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science 1 (1995), URL: http://www.elsevier.nl/locate/entcs/volume1.html.
10. Gordon A.D., Pitts A.M. Higher Order operational Techniques in Semantics. 1998;Cambridge University Press. Publications of the Newton Institute
11. F. Honsell and M. Lenisa, Final semantics for untyped lambda-calculus, In: Proc. 2nd International Conference on Typed Lambda Calculus and Applications, Edinburgh, Lecture Notes in Computer Science 902 (1995), pp. 249-265.
12. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation. 124:1996;103-112
13. Hyland J.M.E. A characterisation of the equality in some models for the lambda calculus. Journal of the London Mathematical Society. 12:1976;361-370
14. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS. 62:1997;222-259
15. S. B. Lassen, Relational reasoning about contexts, In: Gordon and Pitts [10], pages 91-135.
16. M. Lenisa, A uniform syntactical method for proving coinduction principles in λ-calculi, In: M. Bidoit and M. Dauchet, editors, TAPSOFT '97, Lecture Notes in Computer Science 1214 (1997), pp. 309-320.
17. Longo G. Set-theoretical models of lambda calculus: Theories, expansions and isomophisms. Annals of Pure and Applied Logic. 24:1983;153-188
18. J. H. Morris, "Lambda-Calculus Models of Programming Languages," PhD thesis, MIT, Dec. 1968.
19. C.-H. L. Ong, "The Lazy Lambda Calculus: An Investigation into the Foundations of Functional Programming," PhD thesis, University of London, 1988.
20. D. Sands, Improvement theory and its applications, In Gordon and Pitts [10], pages 275-306.
21. Sangiorgi D. The lazy lambda calculus in a concurrency senario. Information and Computation. 111:1994;120-153
22. D. Sangiorgi, On the bisimulation proof method, Technical Report LFCS-94-299, University of Edinburgh, Aug. 1994.
23. ∞-models of the lambda-calculus. SIAM Journal on Computing. 5:1976;488-521