A compiled implementation of strong reduction

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2002, Pages 235-246

  Grégoire, Benjamin ^a   Leroy, Xavier ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

Abstract machine; Beta equivalence; Calculus of constructions; Coq; Normalization by evaluation; Strong reduction; Virtual machine

Indexed keywords

CODES (SYMBOLS); DATA FLOW ANALYSIS; EQUIVALENCE CLASSES; OBJECT ORIENTED PROGRAMMING; PROGRAM INTERPRETERS; RECURSIVE FUNCTIONS;

ABSTRACT MACHINE; BETA EQUIVALENCE; CALCULUS OF CONSTRUCTIONS; OBJECTIVE CAML BYTECODE INTERPRETER; RECURSIVE READ BACK PROCEDURE; VIRTUAL MACHINE;

PROGRAM COMPILERS;

EID: 0036949281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/583852.581501     Document Type: Conference Paper

References (24)

1. A. W. Appel. Compiling with continuations. Cambridge University Press, 1992.
2. K. Appel and W. Haken. Every planar map is four colorable. Illinois J. Math, 21:429-567, 1977.
3. B. Barras. Auto-validation d'un système de preuves avec familles inductives. PhD thesis, University Paris 7, 1999.
4. B. Barras. Programming and computing in HOL. In Theorem Proving in Higher Order Logics 2000, volume 1869 of LNCS, pages 17-37. Springer-Verlag, 2000.
5. B. Barras and B. Werner. Coq in Coq. Submitted for publication, 2000.
6. U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In Logic in Computer Science '91, pages 203-211. IEEE Computer Society Press, 1991.
7. T. Coquand and G. Huet. The calculus of Constructions. Inf. and Comp., 76(2/3):95-120, 1988.
8. G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8(2):173-202, 1987.
9. P. Crégut. An abstract machine for lambda-terms normalization. In Lisp and Functional Programming 1990, pages 333-340. ACM Press, 1990.
10. P. Crégut. Machines à environnement pour la réduction symbolique et l'évaluation partielle. PhD thesis, University Paris 7, 1991.
11. O. Danvy. Type-directed partial evaluation. In 23rd symp. Principles of Progr. Lang, pages 242-257. ACM Press, 1996.
12. O. Danvy. Online type-directed partial evaluation. Technical Report RS-97-53, BRICS, 1997.
13. T. Hardin, L. Maranget, and B. Pagano. Functional runtimes within the lambda-sigma calculus. Journal of Functional Programming, 8(2):131-176, 1998.
14. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. J. ACM, 40(1):143-184, 1993.
15. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
16. X. Leroy. The ZINC experiment: an economical implementation of the ML language. Technical report 117, INRIA, 1990.
17. X. Leroy, D. Doligez, J. Garrigue, and J. Vouillon. The Objective Cam1 system. Software and documentation available on the Web, http://cam1.inria.fr/, 1996-2002.
18. A. Miquel. Le Calcul des Constructions implicite: syntaxe et sémantique. PhD thesis, University Paris 7, 2001.
19. G. Nadathur and D. S. Wilson. A notation for lambda terms: A generalization of environments. Theoretical Comput. Sci., 198:49-98, 1998.
20. S. L. Peyton Jones. Implementing lazy functional languages on stock hardware: the spineless tagless G-machine. Journal of Functional Programming, 2(2):127-202, 1992.
21. F. Pfenning and C. Paulin-Mohring. Inductively defined types in the Calculus of Constructions. In Mathematical Foundations of Programming Semantics, volume 442 of LNCS, pages 209-228. Springer-Verlag, 1990.
22. E. Sumii and N. Kobayashi. Online type-directed partial evaluation for dynamically-typed languages. Computer Software, 17(3):38-62, 2000. Iwanami Shoten.
23. K. N. Verma, J. Goubault-Larrecq, S. Prasad, and S. Arun-Kumar. Reflecting BDDs in Coq. In 6th Asian Computing Science Conference (ASIAN'2000), number 1961 in LNCS, pages 162-181. Springer-Verlag, 2000.
24. R. Vestergaard. The polymorphic type theory of normalisation by evaluation. Draft, 2001.