Interaction for Declarative Theorem Proving
نویسنده
چکیده
This article is concerned with interactive support for \declarative theorem prov-ing". After introducing declarative theorem proving, both in general and as implemented in the Declare system, we outline the requirements of an interactive system in this context. We describe Ideclare, the interactive environment for Declare, and in particular its support for visualisation, logical navigation and debugging. We argue why declarative proof is particularly suited to interactive support, in contrast to general tactic proof, especially because it allows logical navigation without having to discharge proof obligations or execute user-deened tactics along the way. We informally evaluate Ideclare with respect to a number of tasks and discuss several plausible extensions to the proposed mechanisms.
منابع مشابه
BCS Interaction for Declarative Theorem Proving
This article is concerned with interactive support for \declarative theorem proving". After introducing declarative theorem proving, both in general and as implemented in the Declare system, we outline the requirements of an interactive system in this context. We describe Ideclare, the interactive environment for Declare, and in particular its support for visualisation, logical navigation and d...
متن کاملDeclarative Theorem Proving for Operational Semantics
This dissertation is concerned with techniques for formally checking properties of systems that are described by operational semantics. We describe innovations and tools for tackling this problem, and a large case study in the application of these tools. The innovations centre on the notion of \declarative theorem proving", and in particular techniques for declarative proof description. We de n...
متن کاملA synthesis of the procedural and declarative proof styles of interactive theorem proving
This paper contains three contributions. It presents a new mathematical language with an accompanying user interface. It demonstrates a new interaction style for interactive theorem provers. And it proposes a methodology for integrating almost all existing formal mathematical libraries. The mathematical language combines the Mizar proof language with the HOL formula and tactic languages. The in...
متن کاملA Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving
We propose a synthesis of the two proof styles of interactive theorem proving: the procedural style (where proofs are scripts of commands, like in Coq) and the declarative style (where proofs are texts in a controlled natural language, like in Isabelle/Isar). Our approach combines the advantages of the declarative style – the possibility to write formal proofs like normal mathematical text – an...
متن کاملThree Tactic Theorem Proving
We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to proof description: proofs are not described with tactics but by using just three expressive outlining constructs. The language is \declarative" because each step speci es its logical consequences, i.e. the constants and formulae...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998