by Carsten Schurmann, Serge Autexier
http://www.dfki.de/~serge/pub/LFM-2002.ps.gz
Add To MetaCart
Abstract:
This paper describes the proof planning system P # for the meta theorem prover implemented in Twelf. The main contributions include a formal system that approximates the flow of information between universal and existential quantified assumptions within a meta proof, a set of inference rules to reason about those approximations, and a soundness proof that guarantees that the proof planner does not reject promising proof states. 1
Citations
|
811
|
Proof-Carrying Code
– Necula
- 1997
|
|
530
|
A framework for defining logics
– Harper, Honsell, et al.
- 1993
|
|
390
|
PVS: A prototype verification system
– Owre, Shankar, et al.
- 1992
|
|
253
|
The use of explicit plans to guide inductive proofs
– Bundy
- 1988
|
|
188
|
A linear logical framework
– Cervesato, Pfenning
- 1996
|
|
186
|
C.: System description: Twelf - a meta-logical framework for deductive systems,Proceedings of the 16th International Conference on Automated Deduction (CADE-16
– Pfenning, Schurmann
- 1999
|
|
182
|
Logic programming in the LF logical framework
– Pfenning
- 1991
|
|
149
|
Foundational proof-carrying code
– Appel
- 2001
|
|
149
|
LEGO Proof Development System: User’s Manual
– Luo, Pollack
- 1992
|
|
131
|
Isabelle: A Generic Theorem
– Paulson
- 1994
|
|
106
|
An algorithm for testing conversion in type theory
– Coquand
- 1991
|
|
54
|
Automating the Meta Theory of Deductive Systems
– Schürmann
- 2000
|
|
44
|
Natural semantics and some of its meta-theory in Elf
– Michaylov, Pfenning
- 1991
|
|
38
|
INKA - The Next Generation
– Hutter, Sengler
|
|
19
|
Recursion for higher-order encodings
– Schürmann
- 2001
|
|
12
|
A Computational Logic. ACM monograph series
– Boyer, Moore
- 1979
|
|
6
|
A type-theoretic approach to induction with higher-order encodings
– Schürmann
- 2001
|
