Semantical analysis of perpetual strategies in λ-calculus

Theoretical Computer Science

Volumn 212, Issue 1-2, 1999, Pages 183-209

  Honsell, Furio ^a   Lenisa, Marina ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Lambda calculus; Normal forms; Observational equivalences; Reduction strategies; Semantics

Indexed keywords

EID: 0003086621     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00140-6     Document Type: Article

References (18)

1. S. Abramsky, L. Ong, Full abstraction in the lazy lambda calculus, Inform. Comput. 105 (1993) 159-267.
2. H. Barendregt, The Lambda Calculus, its Syntax and Semantics, North-Holland, Amsterdam, 1984.
3. H. Barendregt, J. Bergstra, J.W. Klop, H. Volken, Some notes on λ-reduction, in: Degrees, reductions, and representability in the λ-calculus, Preprint no. 22, Department of Mathematics, University of Utrecht, 1976, pp. 13-53.
4. H. Barendregt, M. Coppo, M. Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, J. Symbolic Logic 48 (1983) 931-940.
5. J.A. Bergstra, J.W. Klop, Strong normalization and perpetual reductions in the lambda calculus, J. Infcom. Proc. Cybernet. 18 (1982) 403-417.
6. C. Böhm, B. Intrigila, The Ant-lion paradigm for strong normalization Inform. Comput. 114 (1994) 30-49.
7. M. Coppo, M. Dezani-Ciancaglini, F. Honsell, G. Longo, Extended type structures and filter lambda models, in: G. Lolli et al. (Eds.), Logic Colloquium'82, North-Holland, Amsterdam, 1984, pp. 241-262.
8. M. Coppo, M. Dezani-Ciancaglini, M. Zacchi, Type theories, normal forms and D∞-lambda-models, Inform. Comput. 72 (1987) 85-116.
9. L. Egidi, F. Honsell, S. Ronchi Della Rocca, Operational, denotational and logical descriptions: a case study, Fund. Inform. 16 (1992) 149-169.
10. F. Honsell, M. Lenisa, Some results on restricted λ-calculi, in: A. Borzyszkowski et al. (Eds.), MFCS'93 Proc, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, 1993, pp. 84-104.
11. M. Lenisa, Semantic techniques for deriving coinductive characterizations of observational equivalences for λ-calculi, in: P. de Groote et al. (Eds.), TLCA'97 Conf. Proc, Lecture Notes in Computer Science, vol. 1210, Springer, Berlin, 1997, pp. 248-266.
12. M. Lenisa, Coinductive characterizations of observational equivalences for λ-calculi via the congruence candidate method, in: M. Bidoit et al. (Eds.), TAPSOFT'97 Conf. Proc, Lecture Notes in Computer Science, vol. 1214, Springer, Berlin, 1997, pp. 309-320.
13. N. Mendler, Inductive types and type constraints in the second-order lambda calculus, Ann. Pure Appl. Logic 51 (1991) 159-172.
14. A.M. Pitts, Relational properties of domains, Inform. Comput. 127 (1996) 66-90.
15. G.D. Plotkin, Call-by-name, call-by-value and the λ-calculus, Theoret. Comput. Sci. 1 (1975) 125-159.
16. F. van Raamsdonk, P. Severi, On normalization, Tech. Report CS-R9545 and CS-R9520, CWI Amsterdam and TU-Eindhoven, 1995.
17. P. Severi, Normalization in Lambda Calculus and its relation to type inference, Ph.D. Thesis, University of Eindhoven, 1996.
18. M.H. Sørensen, Effective longest and infinite reduction paths in untyped λ-calculi, in: H. Kirchner (Ed.), CAAP'96 Conf. Proc, Lecture Notes in Computer Science, vol. 1059, Springer, Berlin, 1996, pp. 287-301.