Verifying Uniqueness in a Logical Framework

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3223, Issue , 2004, Pages 18-33

  Anderson, Penny ^a   Pfenning, Frank ^b  

^a LAFAYETTE COLLEGE   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC;

COVERAGE CHECKING; LOGICAL FRAMEWORKS; METAREASONING; TYPED LAMBDA CALCULUS;

ALGORITHMS;

EID: 34547785885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30142-4_2     Document Type: Article

References (25)

1. T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255-279. Cambridge University Press, 1991.
2. T. Coquand. Pattern matching with dependent types. In Proceedings of the Workshop on Types for Proofs and Programs, pages 71-83, Båstad, Sweden, 1992.
3. K. Crary. Toward a foundational typed assembly language. In G. Morrisett, editor, Proceedings of the 30th Annual Symposium on Principles of Programming Languages, pages 198-212, New Orleans, Louisiana, Jan. 2003. ACM Press.
4. K. Crary and S. Sarkar. A metalogical approach to foundational certified code. Technical Report CMU-CS-03-108, Carnegie Mellon University, Jan. 2003.
5. J. Despeyroux and P. Leleu. A modal lambda calculus with iteration and case constructs. In T. Altenkirch, W. Naraschewski, and B. Reus, editors, Types for Proofs and Programs, pages 47-61, Kloster Irsee, Germany, Mar. 1998. Springer-Verlag LNCS 1657.
6. G. Dowek, T. Hardin, C. Kirchner, and F. Pfenning. Unification via explicit substitutions: The case of higher-order patterns. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 259-273, Bonn, Germany, Sept. 1996. MIT Press.
7. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, Jan. 1993.
8. R. Harper and F. Pfenning. On equivalence and canonical forms in the LF type theory. Transactions on Computational Logic, 2003. To appear. Preliminary version available as Technical Report CMU-CS-00-148.
9. M. Hofmann. Extensional Concepts in Intensional Type Theory. PhD thesis, Department of Computer Science, University of Edinburgh, July 1995. Available as Technical Report CST-117-95.
10. M. Hofmann and T. Streicher. The groupoid model refutes uniqueness of identity proofs. In Proceedings of the 9th Annual Symposium on Logic in Computer Science (LICS'94), pages 208-212, Paris, France, 1994. IEEE Computer Society Press.
11. C. McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999. Available as Technical Report ECS-LFCS-00-419.
12. F. Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84-141, Mar. 2000.
13. F. Pfenning. Logical frameworks. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, chapter 17, pages 1063-1147. Elsevier Science and MIT Press, 2001.
14. F. Pfenning and C. Schürmann. Algorithms for equality and, unification in the presence of notational definitions. In T. Altenkirch, W. Naraschewski, and B. Reus, editors, Types for Proofs and Programs, pages 179-193, Kloster Irsee, Germany, Mar. 1998. Springer-Verlag LNCS 1657.
15. F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical 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.
16. B. Pientka. Termination and reduction checking for higher-order logic programs. In First International Joint Conference on Automated Reasoning (IJCAR), pages 401-415, Siena, Italy, 2001. Springer Verlag, LNCS 2083.
17. A. Poswolsky and C. Schürmann. Factoring pure logic programs. Draft manuscript, Nov. 2003.
18. E. Rohwedder and F. Pfenning. Mode and termination checking for higher-order logic programs. In H. R. Nielson, editor, Proceedings of the European Symposium on Programming, pages 296-310, Linköping, Sweden, Apr. 1996. Springer-Verlag LNCS 1058.
19. C. Schürmann. Automating the Meta Theory of Deductive Systems. PhD thesis, Department of Computer Science, Carnegie Mellon University, Aug. 2000. Available as Technical Report CMU-CS-00-146.
20. C. Schürmann. Recursion for higher-order encodings. In L. Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL 2001), pages 585-599, Paris, France, August 2001. Springer Verlag LNCS 2142.
21. C. Schürmann. A type-theoretic approach to induction with higher-order encodings. In Proceedings of the Conference on Logic for Programming, Artificial Intelligence and Reasoning(LPAR 2001), pages 266-281, Havana, Cuba, 2001. Springer Verlag LNAI 2250.
22. C. Schürmann. Delphin - toward functional programming with logical frameworks. Technical Report TR #1272, Yale University, Department of Computer Science, 2004.
23. C. Schürmann, J. Despeyroux, and F. Pfenning. Primitive recursion for higherorder abstract syntax. Theoretical Computer Science, 266:1-57, 2001.
24. C. Schürmann and F. Pfenning. A coverage checking algorithm for LF. In D. Basin and B. Wolff, editors, Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003), pages 120-135, Rome, Italy, Sept. 2003. Springer-Verlag LNCS 2758.
25. G. Washburn and S. Weirich. Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism. In Proceedings of the Eighth International Conference on Functional Programming, pages 249-262, Uppsala, Sweden, Aug. 2003. ACM Press.