Selected papers that cite this one
- Thorsten Altenkirch, Martin Hofmann, and Thomas Streicher. Reduction-free normalisation for a polymorphic system. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 98-106, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
- David Aspinall and Adriana Compagnoni. Subtyping dependent types (summary). In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 86-97, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
- David Basin, Seán Matthews, and Luca Viganò Labelled propositional modal logics: Theory and practice. Journal of Logic and Computation, 7(6):685-717, December 1997.
- Iliano Cervesato and Frank Pfenning. A linear logical framework. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 264-275, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
- Yuxi Fu. Categorical properties of logical frameworks. Mathematical Structures in Computer Science, 7(1):1-47, February 1997.
- Philippa Gardner. Equivalences bewteen logics and their representing type theories. Mathematical Structures in Computer Science, 5(3):323-349, September 1995.
- John Hannan and Patrick Hicks. Higher-order unCurrying. In Conference Record of POPL '98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 1-11, San Diego, California, 19-21 January 1998.
- Robert Harper and Frank Pfenning. A module system for a programming language based on the LF logical framework. Journal of Logic and Computation, 8(1):5-31, February 1998.
- Dale Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165(1):201-232, 30 September 1996.
- Dale Miller. A multiple-conclusion meta-logic. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 272-281, Paris, France, 4-7 July 1994. IEEE Computer Society Press.
- Gopalan Nadathur and Debra Sue Wilson. A notation for lambda terms. A generalization of environments. Theoretical Computer Science, 198(1-2):49-98, 30 May 1998. Fundamental Study.
- George C. Necula. Proof-carrying code. In Conference Record of POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 106-119, Paris, France, 15-17 January 1997.
- George C. Necula and Peter Lee. The design and implementation of a certifying compiler. In Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation (PLDI), pages 333-344, Montreal, Canada, 17-19 June 1998. SIGPLAN Notices 33(5), May 1998.
- Frank Pfenning. Structural cut elimination. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 156-166, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.
Selected references
- Arnon Avron. Simple consequence relations. Information and Computation, 92(1):105-140, May 1991.
- Thierry Coquand and Gérard Huet. The calculus of constructions. Information and Computation, 76(2/3):95-120, February/March 1988.
- Paul F. Mendler and Peter Aczel. The notion of a Framework and a framework for LTC. In Proceedings, Third Annual Symposium on Logic in Computer Science, pages 392-399, Edinburgh, Scotland, 5-8 July 1988. IEEE Computer Society.
- J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, January 1965.