Mechanized meta-reasoning using a hybrid HOAS/de Bruijn representation and reflection

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 2006, Issue , 2006, Pages 172-183

  Hickey, Jason ^a   Nogin, Aleksey ^a   Yu, Xin ^a   Kopylov, Alexei ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Higher order abstract syntax; Languages with bindings; Mechanized reasoning; Meta theory; MetaPRL; NuPRL; Reflection; Type theory

Indexed keywords

HIGHER-ORDER ABSTRACT SYNTAX; LANGUAGES WITH BINDINGS; MECHANIZED REASONING; META-THEORY; TYPE THEORY;

AUTOMATION; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL TRANSFORMATIONS; METADATA; THEOREM PROVING;

FORMAL LOGIC;

EID: 34247218106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159803.1159826     Document Type: Conference Paper

References (24)

1. William Aitken and Robert L. Constable. Reflecting on NuPRL: Lessons 1-4. Technical report, Cornell University, Computer Science Department, Ithaca, NY, 1992.
2. William Aitken, Robert L. Constable, and Judith Underwood. Metalogical Frameworks II: Using reflected decision procedures. Journal of Automated Reasoning, 22(2):171-221, 1993.
3. th Symposium on Logic in Computer Science, pages 95-197. IEEE Computer Society Press, June 1990.
4. Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, and Steve Zdancewic. Mechanized metatheory for the masses: The POPLmark challenge. Available from http://www.cis.upenn.edu/group/proj/ plclub/mmm/, 2005.
5. James Cheney. Towards a general theory of names, binding and scope. In Proceedings of the 2005 workshop on Mechanized reasoning about languages with variable binding, pages 33-40 ACM Press, 2005.
6. Robert L. Constable. Using reflection to explain and enhance type theory. In Helmut Schwichtenberg, editor, Proof and Computation, volume 139 of NATO Advanced Study Institute, International Summer School held in Marktoberdorf, Germany, July 20-August 1, NATO Series F, pages 65-100. Springer, Berlin, 1994.
7. N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagaciones Mathematische, 34:381-392, 1972. This also appeared in the Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, series A, 75, No. 5.
8. Kurt Gödel. Über formal unentscheidbare sätre der principia mathematica und verwandter systeme I. Monatshefte für Mathematik und Physik, 38:173-198, 1931. English version in [24].
9. 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. A revised and expanded version of the 1987 paper.
10. J. Harrison. Metatheory and reflection in theorem proving: A survey and critique. Technical Report CRC-53, SRI International, Cambridge Computer Science Research Centre, Millers Yard, Cambridge, UK, February 1995.
11. Dimitri Hendriks. Proof reflection in Coq. Journal of Automated Reasoning, 29(3):277-307, 2002.
12. th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003), volume 2758 of Lecture Notes in Computer Science, pages 287-303. Springer-Verlag, 2003.
13. Jason Hickey, Aleksey Nogin, Xin Yu, and Alexei Kopylov. Practical reflection for sequent logics. In Proceedings of the International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'06), Electronic Notes in Theoretical Computer Science, 2006. To appear.
14. Jason J. Hickey, Brian Aydemir, Yegor Bryukhov, Alexei Kopylov, Aleksey Nogin, and Xin Yu. A listing of MetaPRL theories, http://metaprl.org/theories. pdf.
15. Jason J. Hickey, Aleksey Nogin, Alexei Kopylov, et al. MetaPRL home page, http://metaprl.org/.
16. th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002), volume 2410 of Lecture Notes in Computer Science, pages 281-297. Springer-Verlag, 2002.
17. Aleksey Nogin and Alexei Kopylov. Formalizing type operations using the "Image" type constructor. Accepted to to Workshop on Logic, Language, Information and Computation (WoLLIC), 2006.
18. Aleksey Nogin, Alexei Kopylov, Xin Yu, and Jason Hickey. A computational approach to reflective meta-reasoning about languages with bindings. In MERLIN '05: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, pages 2-12. ACM Press, 2005. An extended version is available as California Institute of Technology technical report CaltechCSTR:2005.003.
19. Russell OConnor. Essential incompleteness of arithmetic verified by Coq. In Proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005), volume 3603 of Lecture Notes in Computer Science, pages 245-260, 2005.
20. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation (PLDI), volume 23(7) of SIGPLAN Notices, pages 199-208, Atlanta, Georgia, June 1988. ACM Press.
21. Andrew M. Pitts and Murdoch Gabbay. A metalanguage for programming with bound names modulo renaming. In R. Backhouse and J. N. Oliveira, editors, Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer-Verlag, Heidelberg, 2000.
22. Gordon Plotkin. An illative theory of relations. In R. Cooper, K. Mukai, and J. Perry, editors, Situation Theory and Its Applications, Volume I, number 22 in CSLI Lecture Notes, pages 133-146. Centre for the Study of Language and Information, 1990.
23. Harald Rueß. Computational reflection in the calculus of constructions and its application to theorem proving. In R. Hindley, editor, Proceedings of the International Conference on Typed Lambda Calculus and its Applications (TLCA '97), volume 1210 of Lecture Notes in Computer Science, Nancy, France, April 1997. Springer-Verlag.
24. J. van Heijenoort, editor. From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931. Harvard University Press, Cambridge, MA, 1967.