Automated theorem proving in a simple meta-logic for LF

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

Volumn 1421, Issue , 1998, Pages 286-300

  Schürmann, Carsten ^a   Pfenning, Frank ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER CIRCUITS; ENCODING (SYMBOLS); FORMAL LOGIC; INDUCTIVE LOGIC PROGRAMMING (ILP);

AUTOMATED THEOREM PROVER; AUTOMATED THEOREM PROVING; DEDUCTION THEOREMS; INDUCTION PRINCIPLES; INDUCTIVE REASONING; INTUITIONISTIC PROPOSITIONAL LOGIC; LOGICAL FRAMEWORKS; REPRESENTATION TECHNIQUES;

THEOREM PROVING;

EID: 84957086988     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054266     Document Type: Conference Paper

References (18)

1. [Coq91] Thierry Coquand. An algorithm for testing conversion in type theory. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 255-279. Cambridge University Press, 1991.
2. [CP96] Iłiano Cervesato and Frank Pfenning. A linear logical framework. In E. Clarke, editor, Proceedings of the Eleventh Annual Symposium on Logic in Computer Science, pages 264-275, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
3. [DPS97] Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmarm. 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), pages 147-163, Nancy, France, April 1997. Springer-Verlag LNCS.
4. [Eri94] Lars-Henrik Eriksson. Pi: An interactive derivation editor for the calculus of partial inductive definitions. In Alan Bundy, editor, Proceedings of the Twelfth International Conference on Automated Deduction, pages 821-825. Springer-Verlag LNAI 814, June 1994.
5. [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.
6. [Mag95] Lena Magnusson. The Implementation of ALF-A Proof Editor Based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution. PhD thesis, Chalmers University of Technology and Göteborg University, January 1995.
7. [McD97] Raymond McDowell. Reasoning in a logic with definitions and induction. PhD thesis, University of Pennsylvania, 1997.
8. [MM97] Raymond McDowell and Dale Miller. A logic for reasoning with higher-order abstract syntax: An extended abstract. In Glynn Winskel, editor, Proceedings of the Twelfth Annual Symposium on Logic in Computer Science, Warsaw, Poland, June 1997. To appear.
9. [MP91] Spiro Michaylov and Frank Pfenning. Natural semantics and some of its metatheory in Elf. In L.-H. Eriksson, L. Hallnäs, and P. Schroeder-Heister, editors, Proceedings of the Second International Workshop on Extensions of Logic Programming, pages 299-344, Stockholm, Sweden, January 1991. Springer-Verlag LNAI 596.
10. [Pfe91] Frank Pfenning. Unification and anti-unification in the Calculus of Constructions. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 74-85, Amsterdam, The Netherlands, July 1991.
11. [Pfe92] Frank Pfenning. Computation and deduction. Unpublished lecture notes, 277 pp. Revised May 1994, April 1996, May 1992.
12. [Pfe94] Frank Pfenning. Elf: A metalanguage for deductive systems. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, pages 811-815, Nancy, France, June 1994. Springer-Verlag LNAI 814. System abstract.
13. [Pfe96] Frank Pfenning. The practice of logical frameworks. In Hélène Kirchner, editor, Proceedings of the Colloquium on Trees in Algebra and Programming, pages 119-134, Linköping, Sweden, April 1996. Springer-Verlag LNCS 1059. Invited talk.
14. [PR92] Frank Pfenning and Ekkehard Rohwedder. Implementing the meta-theory of deductive systems. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction, pages 537-551, Saratoga Springs, New York, June 1992. Springer-Verlag LNAI 607.
15. [Roh94] Ekkehard Rohwedder. Verifying the meta-theory of deductive systems. Thesis Proposal, February 1994.
16. [RP96] Ekkehard Rohwedder and Frank Pfenning. Mode and termination checking for higher-order logic programs. In Hanne Riis Nielson, editor, Proceedings of the European Symposium on Programming, pages 296-310, Linköping, Sweden, April 1996. Springer-Verlag LNCS 1058.
17. [SH93] Peter Schroeder-Heister. Rules of definitional reflection. In M. Vardi, editor, Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pages 222-232, Montreal, Canada, June 1993.
18. [SP98] Carsten Schiirmann and Frank Pfenning. Automated theorem proving in a simple meta-logic for LF. Technical Report CMU-CS-98-123, Carnegie Mellon University, 1998.