Abstract. A formalisation of the implicational fragments of two sequent calculi and a sequent-style presentation of natural deduction in Coq is presented. The systems presented are all typed lambda calculi. Based on this formalisation, some general comments on the feasibility of performing metatheoretic proofs about typed lambda calculi in a proof assistant based on higher-order type theory are made. Conclusions about the suitability of Coq for this work, as well as some indications as to the future use of completely formal developments in meta-theoretic reasoning, are drawn. 1
|
280
|
Intuitionistic Type Theory
– Martin-Lof
- 1984
|
|
176
|
Investigations into logical deduction
– Gentzen
- 1969
|
|
140
|
Isabelle: A Generic Theorem
– Paulson
- 1994
|
|
98
|
The Collected Papers of Gerhard Gentzen
– Szabo, editor
- 1969
|
|
92
|
Experiments with proof plans for induction
– Bundy, Harmelen, et al.
- 1991
|
|
60
|
Natural Deduction: A
– Prawitz
- 1965
|
|
46
|
A -calculus structure isomorphic to gentzen-style sequent calculus structure
– Herbelin
- 1994
|
|
44
|
Five axioms of alpha-conversion
– Gordon, Melham
- 1996
|
|
35
|
A user's guide to ALF
– Altenkirch, Gaspes, et al.
- 1994
|
|
34
|
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic
– Dyckhoff, Pinto
- 1998
|
|
33
|
Implementing the Meta-Theory of Deductive Systems
– Pfenning, Rohwedder
- 1992
|
|
30
|
Pure type systems formalized
– McKinna, Pollack
- 1993
|
|
29
|
From semantics to rules: a machine assisted analysis
– Coquand
- 1993
|
|
29
|
Checking algorithms for pure type systems
– Jutting, McKinna, et al.
- 1993
|
|
25
|
Higher-order abstract syntax in Coq
– Despeyroux, Felty, et al.
- 1995
|
|
21
|
Permutability of proofs in intuitionistic sequent calculi
– Dyckhoff, Pinto
- 1999
|
|
13
|
A logic program for transforming sequent proofs to natural deduction proofs
– Felty
- 1991
|
|
10
|
Residual theory in -calculus: a complete Gallina development
– Huet
- 1994
|
|
9
|
A formalisation of the strong normalisation proof for System F
– Altenkirch
- 1993
|
|
8
|
Termination proof of term rewriting systems with the multiset path ordering: A complete development in the system Coq
– Leclerc
- 1995
|
|
6
|
On proof normalisation
– Galmiche, Perrier
- 1994
|
|
6
|
editors. Theorem Proving in Higher Order Logics
– Grundy, Newey
- 1998
|
|
4
|
A.: "Meta-theory of sequent calculus and natural deduction systems in Coq
– Adams
- 1996
|
|
4
|
de Bruijn. -Calculus Notation with Nameless Dummies, A Tool for Automatic Formula Manipulation
– G
- 1972
|
|
4
|
editors. To H.B. Curry: essays on combinatory logic, lambda calculus and formalism
– Seldin, Hindley
- 1980
|
|
3
|
A language for implementing arbitrary logics
– Tarver
- 1993
|
|
2
|
SEQUEL Frameworks for the Meta-Theory of Sequent Calculus and Natural Deduction Systems. Unpublished Research Report
– Adams
- 1995
|
|
2
|
Formalization of a -Calculus with Explicit Substitutions in Coq
– Saibi
- 1994
|
|
1
|
as a Tool for Proving Properties of Sequent-Calculus Systems. Unpublished Research Report
– ALF
- 1995
|
|
1
|
Meta-Theory in the Higher-Order Logic Framework Isabelle
– Adams
- 1996
|
|
1
|
Rippling: a heuristic for guiding inductive proofs
– Barendregt, Nipkow, et al.
- 1994
|
|
1
|
Dowek et al. The Coq Proof Assistant Reference Manual (Version 5.10
– unknown authors
- 1995
|
|
1
|
de Bruijn. A Survery of the Project AUTOMATH
– G
|
|
