Dependent types ensure partial correctness of theorem provers

Journal of Functional Programming

Volumn 14, Issue 1, 2004, Pages 3-19

  Appel, Andrew W ^a   Felty, Amy P ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GOAL-DIRECTED PROOF SEARCH; TWELF SYSTEM;

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATABASE SYSTEMS; DECISION MAKING; ERROR ANALYSIS; FUNCTIONS; THEOREM PROVING;

COMPUTER PROGRAMMING;

EID: 0842311319     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796803004921     Document Type: Article

References (16)

1. Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1974) The Design and Analysis of Computer Algorithms. Addison-Wesley.
2. Altenkirch, T., Gaspes, V., Nordström, B. and von Sydow, B. (1994) A user's guide to ALF. Technical report, Chalmers University of Technology, Sweden.
3. Appel, A. W. (2000) Hints on proving theorems in Twelf. www.cs.princeton.edu/̃appel/twelftutorial.
4. Appel, A. W. and Felty, A. P. (2000) A semantic model of types and machine instructions for proof-carrying code.POPL '00: 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 243-253. ACM Press.
5. Barras, B. et al. (1998) The Coq Proof Assistant reference manual. Technical report, INRIA.
6. Bove, A. (1999) Programming in Martin-Löf type theory: Unification, a non-trivial example. Licentiate Thesis, Chalmers University of Technology and Göteborg University.
7. Felty, A. (1993) Implementing tactics and tacticals in a higher-order logic programming language. J. Automated Reasoning, 11(1), 43-81.
8. Gordon, M. J. C. and Melham, T. F. (1993) Introduction to HOL - A Theorem Proving Environment for Higher Order Logic. Cambridge University Press.
9. Gordon, M. J., Milner, R. and Wadsworth, C. P. (1979) Edinburgh LCF: A mechanised logic of computation: Lecture Notes in Computer Science 78. Springer-Verlag.
10. Harper, R., Honsell, F. and Plotkin, G. (1993) A framework for defining logics. J. ACM, 40(1), 143-184.
11. McBride, C. (2001) First-order unification by structural recursion. J. Functional Programming. To appear.
12. Nadathur, G. and Miller, D. (1988) An overview of lambda prolog. In: Bowen, K. and Kowalski, R. (editors), Fifth International Conference and Symposium on Logic Programming. MIT Press.
13. Paulson, L. C. (1994) Isabelle: A generic theorem proven Lecture Notes in Computer Science 828. Springer-Verlag.
14. Pfenning, F. and Schürmann, C. (1999) System description: Twelf - a meta-logical framework for deductive systems. 16th International Conference on Automated Deduction. Springer-Verlag.
15. Pollack, R. (1994) The theory of LEGO: A proof checker for the extended calculus of constructions. PhD thesis, University of Edinburgh.
16. Pollack, R. (1995) On extensibility of proof checkers. In: Dybjer, P., Nordstrom, B. and Smith, J. (editors), Types for Proofs and Programs: International Workshop Types'94: Lecture Notes in Computer Science 996. Springer-Verlag.