Semantic analysis of normalisation by evaluation for typed lambda calculus

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)

Volumn , Issue , 2002, Pages 26-37

  Fiore, Marcelo ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Categorical glueing; Initial algebra semantics; Lambda definability; Logical relations; Normalisation by evaluation; Typed abstract syntax with variable binding; Typed lambda calculus

Indexed keywords

ALGEBRA; ALGORITHMS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

LOGICAL RELATIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0036992209     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571157.571161     Document Type: Conference Paper

References (35)

1. M. Alimohamed. A characterization of lambda definability in categorical models of implicit polymorphism. Theoretical Computer Science, 146(1-2):5-23, 1995.
2. th Annual IEEE Symposium on Logic in Computer Science, pages 203-210, 2001.
3. T. Altenkirch, M. Hofmann, and T. Stretcher. Categorical reconstruction of a reduction-free normalization proof. In Category Theory and Computer Science, volume 953 of Lecture Notes in Computer Science, pages 182-199. Springer-Verlag, 1995.
4. U. Berger. Program extraction from normalization proofs. In [6], pages 91-106, 1993.
5. th Annual IEEE Symposium on Logic in Computer Science, pages 203-211, 1991.
6. M. Bezem and J. Groote, editors. Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
7. C. Coquand. From semantics to rules: A machine assisted analysis. In E. Börger, Y. Gurevich, and K. Meinke, editors, Proc. Computer Science Logic'93, volume 832 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
8. T. Coquand and P. Dybjer. Intuitionistic model constructions and normalization proofs. Mathematical Structures in Computer Science, 7:75-94, 1997. (Preliminary version in Preliminary Proceedings of the 1993 TYPES Workshop.).
9. R. Crole. Categories for Types. Cambridge University Press, 1994.
10. D. Čubrić, P. Dybjer, and P. Scott. Normalization and the Yoneda embedding. Mathematical Structures in Computer Science, 8:153-192, 1997.
11. O. Danvy. Type-directed partial evaluation. In Partial Evaluation - Practise and Theory, Proceedings of the 1998 DIKU Summer School, volume 1706 of Lecture Notes in Computer Science, pages 367-411. Springer-Verlag. 1998.
12. O. Danny and P. Dybjer, editors. Preliminary Proceedings of the APPSEM Workshop on Normalisation by Evaluation, BRICS Note NS-98-1. Department of Computer Science, University of Aarhus, 1998.
13. O. Danvy, P. Dybjer, and A. Filinski. Normalization and partial evaluation. Preliminary lecture notes for the International Summer School on Applied Semantics, 2000.
14. A. Filinski. A semantic account of type-directed partial evaluation. In Principles and Practice of Declarative Programming, volume 1702 of Lecture Notes in Computer Science, pages 378-395. Springer-Verlag, 1999.
15. A. Filinski. Normalization by evaluation for the computational lambda-calculus. In Typed Lambda Calculi and Applications, Lecture Notes in Computer Science. Springer-Verlag, 2001.
16. M. Fiore, R. Di Cosmo, and V. Balat. Extensional normalisation for typed lambda calculus with sums via Grothendieck logical relations. Manuscript, 2002.
17. th Annual IEEE Symposium on Logic in Computer Science, pages 193-202, 1999.
18. M. Fiore and A. Simpson. Lambda definability with sums via Grothendieck logical relations. In Typed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science, pages 147-161. Springer-Verlag, 1999.
19. FreshML - A Fresh Approach to Name Binding in Metaprogramming Languages. In http://www.cl.cam.ac.uk/̃amp12/research/freshml/, 2001.
20. J.-Y. Girard. Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur. Thèse de doctorat d'état, Université Paris 7, 1972.
21. A. Jung and J. Tiuryn. A new characterization of lambda definability. In [6], pages 245-257, 1993.
22. J. Krivine. Lambda-Calculus, Types and Models. Computers and their Applications. Masson and Ellis Horwood, 1993.
23. J. Lambek and P. Scott. Introduction to higher order categorical logic, volume 7 of Cambridge studies in advanced mathematics. Cambridge University Press, 1986.
24. D. Lehmann and M. Smyth. Algebraic specification of data types: A synthetic approach. Math. Systems Theory, 14:97-139, 1981.
25. Q. Ma and J. Reynolds. Types, abstraction and parametric polymorphism, part 2. In Mathematical Foundations of Programming Semantics, volume 598 of Lecture Notes in Computer Science, pages 1-40. Springer-Verlag, 1992.
26. rd Scandinavian Logic Symposium, pages 81-109, 1975.
27. F. Pfenning and C. Elliot. Higher-order abstract syntax. In Proc. of the ACM SIGPLAN '38 Symposium on Language Design and Implementation, 1988.
28. G. Plotkin. Lambda-definability and logical relations. Technical report, School of Artificial Intelligence, University of Edinburgh, 1973.
29. J. Reynolds. Normalization and functor categories. In [12], pages 33-36, 1998.
30. R. Statman. Logical relations and the typed lambda calculus. Inf. and Control, 65:85-97, 1985.
31. T. Stretcher. Categorical intuitions underlying semantic normalisation proofs. In [12], pages 9-10, 1998.
32. T. Stretcher. Denotational completeness revisited. In Electronic Notes in Theoretical Computer Science, volume 29. Elsevier Science Publishers, 2000.
33. W. Tait. Intensional interpretation of functionals of finite type I. Journal of Symbolic Logic, 32, 1967.
34. P. Taylor. Practical Foundations of Mathematics, volume 59 of Cambridge studies in advanced mathematics. Cambridge University Press, 1999.
35. G. Wraith. Artin glueing. Journal of Pure and Applied Algebra, 4:345-348, 1974.