A computational approach to reflective meta-reasoning about languages with bindings

MERLIN'05 - Proceedings of the Third ACM SIGPLAN Workshop in Mechanized Reasoning about Languages with varIable biNding

Volumn , Issue , 2005, Pages 2-12

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Higher Order Abstract Syntax; Languages with Bindings; MetaPRL; NuPRL; Programming Language Experimentation; Reflection; Type Theory

Indexed keywords

HIGHER-ORDER ABSTRACT INDEX; LANGUAGES WITH BINDINGS; METAPRL; NUPRL; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES; PARAMETER ESTIMATION; REFLECTION; THEOREM PROVING;

METADATA;

EID: 32044453783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088454.1088456     Document Type: Conference Paper

References (63)

1. [AA99] Eric Aaron and Stuart Allen. Justifying calculational logic by a conventional metalinguistic semantics. Technical Report TR99-1771, Cornell University, Ithaca, New York, September 1999.
2. +05] 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.
3. [AC92] William Aitken and Robert L. Constable. Reflecting on NuPRL: Lessons 1-4. Technical report, Cornell University, Computer Science Department, Ithaca, NY, 1992.
4. th International Conference on Automated Deduction, volume 1831 of Lecture Notes in Artificial Intelligence, pages 170-176. Springer Verlag, 2000.
5. th Symposium on Logic in Computer Science, pages 95-197. IEEE Computer Society Press. June 1990.
6. [ACM02] Simon Ambler, Roy L. Crole, and Alberto Momigliano. Combining higher order abstract syntax with tactical theorem proving and (co)induction. In TPHOLs '02: Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, pages 13-30, London, UK, 2002. Springer-Verlag.
7. [ACM03] S. J. Ambler, R. L. Crole, and Alberto Momigliano. A definitional approach to primitive recursion over higher order abstract syntax. In Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding, pages 1-11. ACM Press, 2003.
8. [ACU93] William Aitken, Robert L. Constable, and Judith Underwood, Metalogical Frameworks II: Using reflected decision procedures. Journal of Automated Reasoning, 22(2):171-221, 1993.
9. nd IEEE Symposium on Logic in Computer Science, pages 215-224. IEEE Computer Society Press, June 1987.
10. [All87b] Stuart F. Allen. A Non-Type-Theoretic Semantics for Type-Theoretic Language. PhD thesis, Cornell University, 1987.
11. [Art99] Sergei Artemov. On explicit reflection in theorem proving and formal verification. In Ganzinger [Gan99], pages 267-281.
12. [Art04] Sergei Artemov. Evidence-based common knowledge. Technical Report TR-2004018, CUNY Ph.D. Program in Computer Science Technical Reports. November 2004.
13. th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002), Hampton, VA, August 2002, pages 23-32. National Aeronautics and Space Administration, 2002.
14. [BAC03] Eli Barzilay, Stuart Allen, and Robert Constable. Practical reflection in NuPRL. Short paper presented at 18th Annual IEEE Symposium on Logic in Computer Science, June 22-25, Ottawa, Canada, 2003.
15. [Bar01] Eli Barzilay. Quotation and reflection in NuPRL and Scheme. Technical Report TR2001-1832, Cornell University. Ithaca, New York, January 2001.
16. [Bar05] Eli Barzilay. Implementing Reflection in NuPRL. PhD thesis, Cornell University, 2005. In preparation.
17. +86] Robert L. Constable, Stuart F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Crenier, R. W. Harper, Douglas J. Howe, T. B. Knoblock. N. P. Mendler, P. Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with the NuPRL Proof Development System. Prentice-Hall, NJ, 1986.
18. [CFW04] Luís Crus-Filipe and Freek Weidijk. Hierarchical reflection. In Slind et al. [SBG04], pages 66-81.
19. [Con94] 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 I, NATO Series F, pages 65-100. Springer, Berlin, 1994.
20. [dB72] 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.
21. This also appeared in the Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, series A, 75, No. 5.
22. [DFH95] Joëlle Despeyroux, Amy Felty, and André Hirschowitz. Higher-order abstract syntax in Coq. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proceedings of the International Conference on Typed Lambda Calculus and its Applications, volume 902 of Lecture Notes in Computer Science, pages 124-138. Springer-Verlag, April 1995.
23. Also appears as INRIA research report RR-2556.
24. [DH94] Joëlle Despeyroux and André Hirschowitz. Higher-order abstract syntax with induction in Coq. In LPAR '94: Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning, volume 822 of Lecture Notes in Computer Science, pages 159-173. Springer-Verlag, 1994.
25. Also appears as INRIA research report RR-2292.
26. [DH95] James Davis and Daniel Huttenlocher. Shared annotations for cooperative learning. In Proceedings of the ACM Conference on Computer Supported Cooperative Learning, September 1995.
27. [DL99] Joëlle Despeyroux and Pierre Leleu. A modal lambda calculus with iteration and case constructs. In T. Altenkirch, W. Naraschewski, and B. Reus, editors, Types for Proofs and Programs: International Workshop, TYPES '98. Kloster Irsee, Germany, March 1998, volume 1657 of Lecture Notes in Computer Science, pages 47-61, 1999.
28. [DL01] Joëlle Despeyroux and Pierre Leleu. Recursion over objects of functional type. Mathematical Structures in Computer Science, 11(4):555-572, 2001.
29. [DPS97] Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann, Primitive recursion for higher-order abstract syntax. In R. Hindley, editor, Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97), volume 1210 of Lecture Notes in Computer Science, pages 147-163. Springer-Verlag, April 1997.
30. An extended version is available as Technical Report CMU-CS-96-172, Carnegie Mellon University.
31. [EM71] Andrzej Ehrenfeucht and Jan Mycielski. Abbreviating proofs by adding new axioms. Bulletin of the American Mathematical Society, 77:366-367, 1971.
32. +86] Solomon Feferman et al., editors. Kurt Gödel Collected Works, volume 1. Oxford University Press, Oxford. Clarendon Press, New York, 1986.
33. th IEEE Symposium on Logic in Computer Science, pages 193+. IEEE Computer Society Press, 1999.
34. th International Conference on Automated Deduction, volume 1632 of Lecture Notes in Artificial Intelligence. Berlin, July 7-10 1999. Trento, Italy.
35. [GM96] A. D. Gordon and T. Melham. Five axioms of alpha-conversion. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, Turku, Finland August 1996: Proceedings, volume 1125 of Lecture Notes in Computer Science, pages 173-190. Springer-Verlag, 1996.
36. [GMO03] Jim Grundy, Tom Melham, and John O'Leary. A reflective functional language for hardware design and theorem proving. Technical Report PRG-RR-03-16. Oxford Univerity, Computing Laboratory. 2003.
37. [Göd31] Kurt Gödel. Über formal unentscheidbare sätze der principia mathematica und verwandier systeme I. Monatshefte für Mathematik und Physik, 38:173-198, 1931. English version in [vH67].
38. +86], pages 397-399.
39. [GS89] F. Giunchiglia and A. Smaill. Reflection in constructive and non-constructive automated reasoning. In H. Abramson and M. H. Rogers, editors, Meta-Programming in Logic Programming, pages 123-140. MIT Press, Cambridge, Mass., 1989.
40. th International Conference. TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 162-178. Springer-Verlag, 2000.
41. +] Jason J. Hickey, Brian Aydemir, Yegor Bryukhov, Alexei Kopylov, Aleksey Nogin, and Xin Yu. A listing of MetaPRL theories. http://metaprl.org/theories.pdf.
42. [Har95] 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.
43. [HHP93] 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 verion of '87 paper.
44. th International Conference on Automated Deduction, volume 1249 of Lecture Notes in Artificial Intelligence, pages 395-399. Springer, July 13-17 1997. An extended version of the paper can be found at http://www.cs.caltech. edu/~jyh/papers/cade14_nl/default.html.
45. [Hic99] Jason J. Hickey. Fault-tolerant distributed theorem proving. In Ganzinger [Gan99], pages 227-231.
46. [Hic01] Jason J. Hickey. The MetaPRL Logical Programming Environment. PhD thesis, Cornell University, Ithaca, NY, January 2001.
47. [HL78] Gérard P. Huet and Bernard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31-55, 1978.
48. 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.
49. +] Jason J. Hickey, Aleksey Nogin, Alexei Kopylov, et al. MetaPRL home page, http://metaprl.org/.
50. [Mos52] Andrzej Mostowski. Sentences undecidable in formalized arithmetic: an exposition of the theory of Kurt Gödel. Amsterdam: North-Holland, 1952.
51. 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.
52. [NKYH05] Aleksey Nogin, Alexei Kopylov, Xin Yu, and Jason Hickey. A computational approach to reflective meta-reasoning about languages with bindings. Technical Report CaltechCSTR:2005.003, California Institure of Technology, 2005. Available at http://resolver.caltech.edu/CaltechCSTR:2005.003.
53. [Nor04] Michael Norrish. Recursive function definition for types with binders. In Slind et al. [SBG04], pages 241-256.
54. [Par71] R. Parikh. Existence and feasibility in arithmetic. The Journal of Symbolic Logic, 36:494-508, 1971.
55. [Pau94] Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1994.
56. [PE88] 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.
57. th IEEE Symposium on Logic in Computer Science, pages 313-322, Asilomar Conference Center, Pacific Grove, California, June 1989. IEEE Computer Society Press.
58. [Plo90] 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.
59. [PN90] L. Paulson and T. Nipkow. Isabelle tutorial and user's manual. Technical report, University of Cambridge Computing Laboratory, 1990.
60. th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2004), volume 3223 of Lecture Notes in Computer Science. Springer-Verlag, 2004.
61. th Annual Conference of the EACSL, volume 2142 of Lecture Notes in Computer Science, pages 585-599. Springer-Verlag, 2001.
62. [Smi84] B.C. Smith. Reflection and semantics in Lisp. Principles of Programming Languages, pages 23-35, 1984.
63. [vH67] J. van Heijenoort, editor. From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931, Harvard University Press, Cambridge, MA, 1967.