An executable formalization of the HOL/nuprl connection in the metalogical framework twelf

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

Volumn 4246 LNAI, Issue , 2006, Pages 150-166

  Schürmann, Carsten ^a   Stehr, Mark Oliver ^b  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; SEMANTICS; THEOREM PROVING;

LOGICAL FRAMEWORK; METALOGICAL FRAMEWORK; PROOF TRANSLATORS; SEMANTICS BASED JUSTIFICATION;

LOGIC PROGRAMMING;

EID: 33845201149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_11     Document Type: Conference Paper

References (20)

1. S. Allen. A Non-Type-Theoretic Semantics for Type-Theoretic Language. PhD thesis, Cornell University, September 1987.
2. Penny Anderson and Frank Pfenning. Verifying uniqueness in a logical framework. In Proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'04), Park City, Utah, September 2004. Springer Verlag.
3. E. Barzilay, S.F. Allen, and R. L. Constable. Practical reflection in nuprl. In P. Kolaitis, editor, Proceedings of 18th IEEE Symposium on Logic in Computer Science, June 22-25, 2003, Ottawa, Canada, 2003.
4. R. L. Constable, S. Allen, H. Bromely, W. Cleveland, et al. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, 1986.
5. M. J. C. Gordon and Thomas F. Melham. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
6. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
7. D. J. Howe. Importing mathematics from HOL into Nuprl. In J. Von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics, 9th International Conference, TPHOLs'96, Turku, Finland, August 26-30, 1996, Proceedings, volume 1125 of Lecture Notes in Computer Science, pages 267-282. Springer Verlag, 1996.
8. D. J. Howe, Semantical foundations for embedding HOL in Nuprl. In M. Wirsing and M. Nivat, editors, Algebraic Methodology and Software Technology, volume 1101 of Lecture Notes in Computer Science, pages 85-101, Berlin, 1996. Springer-Verlag.
9. D. J. Howe. A classical set-theoretic model of polymorphic extensional type theory. Manuscript, 1997.
10. D. J. Howe. Toward sharing libraries of mathematics between theorem provers. In Frontiers of Combining Systems, FroCoS'98, ILLC, University of Amsterdam, October 2-4, 1998, Proceedings. Kluwer Academic Publishers, 1998.
11. D. J. Howe, Source Code of the HOL-Nuprl Translator (including Extensions to Nuprl), January 1999.
12. J. Meseguer. General logics. In H.-D. Ebbinghaus et al., editors, Logic Colloquium'87, Granada, Spain, July 1987, Proceedings, pages 275-329. North-Holland, 1989.
13. P. Naumov, M.-O. Stehr, and J. Meseguer, The HOL/NuPRL proof translator - A practical approach to formal interoperability. In Theorem Proving in Higher Order Logics, 14th International Conference, TPHOLs'2001, Edinburgh, Scotland, UK, September 3-6, 2001, Proceedings, volume 2152 of Lecture Notes in Computer Science, pages 329-345. Springer-Verlag, 2001.
14. K. Petersson, J. Smith, and B. Nordstroem. Programming in Martin-Löf's Type Theory. An Introduction. International Series of Monographs on Computer Science. Oxford: Clarendon Press, 1990.
15. F. Pfenning. Elf: A language for logic definition and verified meta-programming. In Fourth Annual Symposium on Logic in Computer Science, pages 313-322, Pacific Grove, California, June 1989. IEEE Computer Society Press.
16. 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.
17. E. Rohwedder and F. Pfenning. Mode and termination checking for higher-order logic programs. In Hanne Riis Nielson, editor, Proceedings of the European Symposium on Programming, volume 1058 of Lecture Notes in Computer Science, pages 296-310, Linköping, Sweden, April 1996. Springer-Verlag.
18. C. Schürmann and F. Pfenning. A coverage checking algorithm for LF. In David Basin and Burkhart Wolff, editors, Proceedings of Theorem Proving in Higher Order Logics (TPHOLs'03), volume 2758 of Lecture Notes in Computer Science, Rome, Italy, 2003. Springer-Verlag.
19. C. Schürmann and M.-O. Stehr. An executable formalization of the HOL/Nuprl connection in the metalogical framework Twelf. Technical report, Yale University, Computer Science Department, 2005. YALEU/DCS/TR-1312.
20. M.-O. Stehr, P. Naumov, and J. Meseguer. A proof-theoretic approach to HOL-Nuprl connection with applications to proof translation (extended abstract). In WADT/CoFI'01, 15th International Workshop on Algebraic Development Techniques and General Workshop of the CoFI WG, Genova, Italy, April 1-3, 2001, 2001. Full version available at http://formal.cs.uiuc.edu/stehr/biblio_stehr. html .