A representation of Fω in LF

Electronic Notes in Theoretical Computer Science

Volumn 58, Issue 1, 2001, Pages 79-96

  Schürmann, Carsten ^a   Yu, Dachuan ^a   Ni, Zhaozhong ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS; SEMANTICS;

CANONICITY; COMPILATION; INFERENCE RULES; OPERATIONAL SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 19144362025     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00280-4     Document Type: Conference Paper

References (21)

1. Constable Robert L., et al. Implementing Mathematics with the Nuprl Proof Development System. 1986;Prentice-Hall, Englewood Cliffs, New Jersey
2. Coquand Thierry. An algorithm for testing conversion in type theory. Huet Gérard, Plotkin Gordon. Logical Frameworks. 1991;255-279 Cambridge University Press
3. Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. In R. Hindley, editor, Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97), pages 147-163, Nancy, France, April 1997. Springer-Verlag LNCS.
4. An extended version is available as Technical Report CMU-CS-96-172, Carnegie Mellon University.
5. Gilles Dowek, Amy Felty, Hugo Herbelin, Gérard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
6. J.-Y. Girard. Interpretation fonctionelle et elimination des coupures de l'arithmetique d'ordre superieur. These D'Etat, Universite Paris VII, 1972.
7. Girard J.-Y., Lafont Y., Taylor P. Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. 1988;Cambridge University Press
8. Harper Robert, Honsell Furio, Plotkin Gordon. A framework for defining logics. Journal of the Association for Computing Machinery. 40:(1):January 1993;143-184
9. Robert Harper and Greg Morrisett. Compiling polymorphism using intensional type analysis. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 130-141, San Francisco, California, 1995.
10. Martin Hofmann. Semantical analysis for higher-order abstract syntax. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 204-213, Trento, Italy, July 1999. IEEE Computer Society Press.
11. Christopher League, Valery Trifonov, and Zhong Shao. Type-preserving compilation of featherweight Java. In Foundations of Object-Oriented Languages (FOOL8), London, January 2001.
12. G. Morrisett, D. Walker, K. Crary, and N. Glew. From system F to typed assembly language. In In 25th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 85-97, San Diego California, USA, 1998. ACM Press.
13. George C. Necula. Proof-carrying code. In Neil D. Jones, editor, Conference Record of the 24th Symposium on Principles of Programming Languages (POPL'97), pages 106-119, Paris, France, January 1997. ACM Press.
14. Lawrence Paulson C. Isabelle: A Generic Theorem Prover. 1994;Springer-Verlag LNCS 828
15. Pfenning Frank. Logic programming in the LF logical framework. Huet Gérard, Plotkin Gordon. Logical Frameworks. 1991;149-181 Cambridge University Press
16. Frank Pfenning. A proof of the Church-Rosser theorem and its representation in a logical framework. Journal of Automated Reasoning, 1993.
17. To appear. A preliminary version is available as Carnegie Mellon Technical Report CMU-CS-92-186, September 1992.
18. Frank Pfenning and Carsten Schürmann. System description: Twelf - a metalogical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, July 1999. Springer-Verlag LNAI 1632.
19. ω in LF. http://www.cs.yale.edu/~carsten/public/merlin01.elf, 2001.
20. Zhong Shao. Implementing typed intermediate language. In Proc. 1998 ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pages 313-323, Baltimore, Maryland, September 1998.
21. Valery Trifonov, Bratin Saha, and Zhong Shao. Fully reflexive intensional type analysis. In Proc. 2000 ACM SIGPLAN International Conference on Functional Programming (ICFP'00), pages 82-93. ACM Press, September 2000.