We present a declarative language inspired by the pseudo-natural language previously used in Matita for the explanation of proof terms. We show how to compile the language to proof terms and how to automatically generate declarative scripts from proof terms. Then we investigate the relationship between the two translations, identifying the amount of proof structure preserved by compilation and re-generation of declarative scripts
Normalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
Most automated theorem provers suffer from the problem thatthey can produce proofs only in formalism...
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Aut...
We present a declarative language inspired by the pseudo-natural language previously used in Matita ...
this paper, we will be concerned with proof assistants that construct a proof object, i.e. a data st...
Proof terms are a useful concept for reasoning about computations in term rewriting. They can be use...
Abstract. We propose a synthesis of the two proof styles of interactive theorem proving: the procedu...
When studying specific deduction techniques and strategies for operational semantics of logic progra...
Abstract. There are two different styles for writing natural deduction proofs: the ‘Gentzen ’ style ...
Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on λ̄µµ̃, a calculus introduced by Curien and He...
There has recently been considerable progress in the area of using computers as a tool for theorem p...
There has recently been considerable progress in the area of using computers as a tool for theorem p...
This report describes DECLARE, a prototype implementation of a declarative proof system for simple h...
This paper outlines the linguistic part of an implemented system namedPROVERB[3] that transforms, ab...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
Normalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
Most automated theorem provers suffer from the problem thatthey can produce proofs only in formalism...
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Aut...
We present a declarative language inspired by the pseudo-natural language previously used in Matita ...
this paper, we will be concerned with proof assistants that construct a proof object, i.e. a data st...
Proof terms are a useful concept for reasoning about computations in term rewriting. They can be use...
Abstract. We propose a synthesis of the two proof styles of interactive theorem proving: the procedu...
When studying specific deduction techniques and strategies for operational semantics of logic progra...
Abstract. There are two different styles for writing natural deduction proofs: the ‘Gentzen ’ style ...
Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on λ̄µµ̃, a calculus introduced by Curien and He...
There has recently been considerable progress in the area of using computers as a tool for theorem p...
There has recently been considerable progress in the area of using computers as a tool for theorem p...
This report describes DECLARE, a prototype implementation of a declarative proof system for simple h...
This paper outlines the linguistic part of an implemented system namedPROVERB[3] that transforms, ab...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
Normalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
Most automated theorem provers suffer from the problem thatthey can produce proofs only in formalism...
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Aut...
View in ORKG
DOI