Normalization by evaluation with typed abstract syntax

Journal of Functional Programming

Volumn 11, Issue 6, 2001, Pages 673-680

  Danvy, Olivier ^a   Rhiger, Morten ^a   Rose, Kristoffer H ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035624415     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796801004166     Document Type: Article

References (22)

1. Altenkirch, T., Hofmann, M. & Streicher, T. (1995) Categorical reconstruction of a reduction-free normalization proof. In: Pitt, D. H., Rydeheard, D. E. & Johnstone, P. (eds.), Category Theory and Computer Science: Lecture Notes in Computer Science 953, pp. 182-199. Springer-Verlag.
2. Altenkirch, T., Hofmann, M. & Streicher, T. (1996) Reduction-free normalisation for a polymorphic system. In: Clarke E. M. (ed.), Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp. 98-106. IEEE Press.
3. Balat, V. & Danvy, O. (1998) Strong normalization by type-directed partial evaluation and run-time code generation. In: Leroy, X. & Ohori, A. (eds.), Proceedings 2nd International Workshop on Types in Compilation: Lecture Notes in Computer Science 1473, pp. 240-252. Springer-Verlag.
4. Berger, U. (1993) Program extraction from normalization proofs. In: Bezem, M. & Groote, J. F. (eds.), Typed Lambda Calculi and Applications: Lecture Notes in Computer Science 664, pp. 91-106. Springer-Verlag.
5. Berger, U. & Schwichtenberg, H. (1991) An inverse of the evaluation functional for typed λ-calculus. In: Kahn, G. (ed), Proceedings 6th Annual IEEE Symposium on Logic in Computer Science, pp. 203-211. IEEE Press.
6. Berger, U., Eberl, M. & Schwichtenberg, H. (1998) Normalization by evaluation. In: Möller, B. & Tucker, J. V. (eds.), Prospects for Hardware Foundations (NADA): Lecture Notes in Computer Science 1546, pp. 117-137. Springer-Verlag.
7. Coquand, T. & Dybjer, P. (1997) Intuitionistic model constructions and normalization proofs. Mathematical Structures in Computer Science, 7, 75-94.
8. Čubrić, D., Dybjer, P. & Scott, P. (1998) Normalization and the Yoneda embedding. Mathematical Structures in Computer Science, 8, 153-192.
9. Danvy, O. (1998) Type-directed partial evaluation. In: Hatcliff, J., Mogensen, T. Æ. & Thiemann, P. (eds.), Partial Evaluation - Practice and Theory; proceedings of the 1998 DIKU Summer School: Lecture Notes in Computer Science 1706, pp. 367-411. Springer-Verlag.
10. Danvy, O. & Dybjer, P. (eds.) (1998) Preliminary Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation, NBE '98, Chalmers, Sweden. BRICS Note Series, nos. NS-98-1.
11. Danvy, O. & Rhiger, M. (2001) A simple take on typed abstract syntax in Haskell-like languages. In: Kuchen, H. & Ueda, K. (eds)., 5th International Symposium on Functional and Logic Programming: Lecture Notes in Computer Science 2024, pp. 343-358. Springer-Verlag.
12. Filinski, A. (1999) A semantic account of type-directed partial evaluation. In: Nadathur, G. (ed.), Proceedings of the International Conference on Principles and Practice of Declarative Programming: Lecture Notes in Computer Science 1702, pp. 378-395. Springer-Verlag.
13. Finne, S., Leijen, D., Meijer, E. & Peyton Jones, S. (1999) Calling hell from heaven and heaven from hell. In: Lee, P. (ed.), Proceedings 1999 ACM SIGPLAN International Conference on Functional Programming, pp. 114-125. ACM Press.
14. Huet, G. (1976) Résolution d'équations dans les langages d'ordre 1, 2, ..., ω. Thèse d'État, Université de Paris VII, Paris, France.
15. Leijen, D. & Meijer, E. (1999) Domain specific embedded compilers. In: Ball, T. (ed.), Proceedings of the 2nd USENIX Conference on Domain-Specific Languages, pp. 109-122.
16. Martin-Löf, P. (1975) About models for intuitionistic type theories and the notion of definitional equality. Proceedings 3rd Scandinavian Logic Symposium: Studies in Logic and the Foundation of Mathematics 82, pp. 81-109. North-Holland.
17. Pfenning, F. & Elliott, C. (1988) Higher-order abstract syntax. In: Schwartz, M. D. (ed.), Proceedings ACM SIGPLAN'88 Conference on Programming Languages Design and Implementation, pp. 199-208. (SIGPLAN Notices, 23(7).) ACM Press.
18. Pfenning, F. & Elliott, C. (1988) Higher-order abstract syntax. In: Schwartz, M. D. (ed.), Proceedings ACM SIGPLAN'88 Conference on Programming Languages Design and Implementation, pp. 199-208. (SIGPLAN Notices, 23(7).) ACM Press.
19. Reynolds, J. C. (1998) Normalization and functor categories. In: Danvy, O. & Dybjer, P. (eds.), Preliminary Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation, NBE '98, Chalmers, Sweden.
20. Rhiger, M. (1999) Deriving a statically typed type-directed partial evaluator. In: Danvy, O. (ed.), Proceedings ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pp. 25-29. BRICS Note Series, no. NS-99-1.
21. Rhiger, M. (2001) PhD thesis, BRICS PhD School, University of Aarhus, Aarhus, Denmark. Forthcoming.
22. Rose, K. (1998) Type-directed partial evaluation using type classes. In: Danvy, O. & Dybjer, P. (eds.), Preliminary Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation, NBE '98, Chalmers, Sweden.