A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Merging Procedural and Declarative Proof
[chapter]
2009
Lecture Notes in Computer Science
There are two different styles for writing natural deduction proofs: the 'Gentzen' style in which a proof is a tree with the conclusion at the root and the assumptions at the leaves, and the 'Fitch' style (also called 'flag' style) in which a proof consists of lines that are grouped together in nested boxes. In the world of proof assistants these two kinds of natural deduction correspond to procedural proofs (tactic scripts that work on one or more subgoals, like those of the Coq, HOL and PVS
doi:10.1007/978-3-642-02444-3_13
fatcat:hhsb5djxi5cbjmzwrmyxbvkcuy