Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 64-76

  Balat, Vincent ^a   Di Cosmo, Roberto ^a,b   Fiore, Marcelo ^c  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b INRIA Roquencourt   (France)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Grothendieck logical relations; Normalisation; Stong sums; Type directed partial evaluation; Typed lambda calculus

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; FORMAL LOGIC; SEMANTICS;

GROTHENDIEK LOGICAL RELATIONS; STRONG SUMS; TYPE-DIRECTED PARTIAL EVALUATION; TYPED LAMBDA CALCULUS;

PROGRAMMING THEORY;

EID: 1442312256     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964007     Document Type: Conference Paper

References (20)

1. T. Altenkirch, P. Dybjer, M. Hofmann, and P. Scott. Normalization by evaluation for typed lambda calculus with co-products. In Sixteenth Annual IEEE Symposium on Logic in Computer Science, pages 203-210. IEEE Computer Society Press, 2001.
2. V. Balat and O. Danvy. Strong normalization by type-directed partial evaluation and run-time code generation. In Second International Workshop on Types in Compilation, number 1473 in Lecture Notes in Computer Science, pages 240-252. Springer-Verlag, 1998.
3. V. Balat and O. Danvy. Memoization in type-directed partial evaluation. In ACM SIGPLAN/SIGSOFT Conference on Generative Programming and Component Engineering (GCSE/SAIG), number 2487 in Lecture Notes in Computer Science, 2002.
4. U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 203-211. IEEE Computer Society Press, 1991.
5. O. Danvy. Type-directed partial evaluation. In Twenty-Third Annual ACM Symposium on Principles of Programming Languages, pages 242-257. ACM Press, 1996.
6. O. Danvy. Type-directed partial evaluation. In Partial Evaluation - Practice and Theory; Proceedings of the 1998 DIKU Summer School, number 1706 in Lecture Notes in Computer Science, pages 367-411. Springer-Verlag, 1998.
7. O. Danvy and P. Dybjer, editors. Preliminary Proceedings of the APPSEM Workshop on Normalization by Evaluation, BRICS Note NS-98-1. Department of Computer Science, University of Aarhus, 1998.
8. O. Danvy and A. Filinski. Abstracting control. In ACM Conference on Lisp and Functional Programming, pages 151-160. ACM Press, 1990.
9. O. Danvy and A. Filinski. Representing control, a study of the CPS transformation. MSCS, 4(2):361-191, December 1992.
10. R. Di Cosmo and D. Kesner. Simulating expansions without expansions. Mathematical Structures in Computer Science, 4:1-48, 1994.
11. D. Dougherty. Some lambda calculi with categorical sums and products. In 5th International Conference on Rewriting Techniques and Applications (RTA-93), volume 690 of Lecture Notes in Computer Science, pages 137-151. Springer-Verlag, 1993.
12. D. Dougherty and R. Subrahmanyam. Equality between functionals in the presence of coproducts. In Tenth Annual IEEE Symposium on Logic in Computer Science, pages 282-291. IEEE Computer Society Press, 1995.
13. D. Dougherty and R. Subrahmanyam. Equality between functionals in the presence of coproducts. Information and Computation, 157:52-83, 2000. (An earlier version appeared as [12]).
14. M. Fiore. Semantic analysis of normalisation by evaluation for typed lambda calculus. In 4th Interactional Conference on Principles and Practice of Declarative Programming (PPDP 2002). ACM Press, 2002.
15. M. Fiore, R. Di Cosmo, and V. Balat. Remarks on isomorphisms in typed lambda calculi with empty and sum types. In Seventeenth Annual IEEE Symposium on Logic in Computer Science, pages 147-156. IEEE Computer Society Press, 2002.
16. M. Fiore and A. Simpson. Lambda-definability with sums via Grothendieck logical relations. In Typed Lambda Calculus and Applications, number 1581 in Lecture Notes in Computer Science, pages 147-161. Springer-Verlag, 1999.
17. N. Ghani. βη-equality for coproducts. In Typed Lambda Calculus and Applications, number 902 in Lecture Notes in Computer Science, pages 171-185. Springer-Verlag, 1995.
18. C. A. Gunter, D. Rémy, and J. G. Riecke. Return types for functional continuations. 1998. (An earlier version appeared as [19]).
19. C. A. Gunter, D. Rémy, and J. G. Riecke. A generalization of exceptions and control in ML. In ACM Conference on Functional Programming and Computer Architecture, 1995.
20. J. Lambek and P. Scott. Introduction to higher order categorical logic, volume 7 of Cambridge studies in advanced mathematics. Cambridge University Press, 1986.