Automated Theorem Proving in a Simple Meta-Logic for LF

@inproceedings{Schrmann1998AutomatedTP,
  title={Automated Theorem Proving in a Simple Meta-Logic for LF},
  author={Carsten Sch{\"u}rmann and Frank Pfenning},
  booktitle={CADE},
  year={1998}
}
Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally incompatible with induction principles needed to reason about them. In this paper we develop a metalogic M2 which allows inductive reasoning over LF encodings, and describe its implementation in Twelf, a special-purpose automated theorem prover for properties of logics and programming languages. We have used Twelf to… CONTINUE READING
Highly Cited
This paper has 61 citations. REVIEW CITATIONS
42 Extracted Citations
20 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

62 Citations

02468'96'00'05'10'15
Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 20 references

Automated theorem proving in a simple meta-logic for LF

  • Carsten Schürmann, Frank Pfenning
  • Technical Report CMU-CS-98-123,
  • 1998

Reasoning in a logic with definitions and induction

  • Raymond McDowell
  • PhD thesis, University of Pennsylvania,
  • 1997

The Implementation of ALF—A Proof Editor Based on Martin-Löf ’s Monomorphic Type Theory with Explicit Substitution

  • Lena Magnusson
  • PhD thesis,
  • 1995

Similar Papers

Loading similar papers…