Isabelle/Isar is a generic framework for human-readable formal proof documents, based on higher-order natural deduction. The Isar proof language provides general principles that may be instantiated to particular object-logics and applications. We discuss specific Isar language elements that support complex induction patterns of practical importance. Despite the additional bookkeeping required for induction with local facts and parameters, definitions, simultaneous goals and multiple rules, the resulting Isar proof texts turn out well-structured and readable. Our techniques can be applied to non-standard variants of induction as well, such as co-induction and nominal induction. This demonstrates that Isar provides a viable platform for build...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
Projet EURECAProofs by induction are important in many computer science and artifical intelligence a...
AbstractInductive methods are basic to program proving and this paper presents the formal part of a ...
The basic motivation of this work is to make formal theory developments with machine-checked proofs ...
Abstract. Isar is an extension of the theorem prover Isabelle with a language for writing human-read...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
Isar offers a high-level proof (and theory) language for Isabelle. We give various examples of Isabe...
We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Amo...
AbstractInteractive theorem provers require too much effort from their users. We have been developin...
The original publication is available at www.springerlink.com.International audienceWe give evidence...
Interactive theorem provers require too much effort from their users. We have been developing a syst...
Abstract. Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It r...
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isab...
Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which ...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
Projet EURECAProofs by induction are important in many computer science and artifical intelligence a...
AbstractInductive methods are basic to program proving and this paper presents the formal part of a ...
The basic motivation of this work is to make formal theory developments with machine-checked proofs ...
Abstract. Isar is an extension of the theorem prover Isabelle with a language for writing human-read...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
Isar offers a high-level proof (and theory) language for Isabelle. We give various examples of Isabe...
We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Amo...
AbstractInteractive theorem provers require too much effort from their users. We have been developin...
The original publication is available at www.springerlink.com.International audienceWe give evidence...
Interactive theorem provers require too much effort from their users. We have been developing a syst...
Abstract. Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It r...
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isab...
Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which ...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
Projet EURECAProofs by induction are important in many computer science and artifical intelligence a...
AbstractInductive methods are basic to program proving and this paper presents the formal part of a ...