Subformula Linking as an Interaction Method

Kaustuv Chaudhuri 1
1 PARSIFAL - Proof search and reasoning with logic specifications
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : Current techniques for building formal proofs interactively involve one or several proof languages for instructing an interpreter of the languages to build or check the proof being described. These linguistic approaches have a drawback: the languages are not generally portable, even though the nature of logical reasoning is universal. We propose a somewhat speculative alternative method that lets the user directly manipulate the text of the theorem, using non-linguistic metaphors. It uses a proof formalism based on linking subformulas, which is a variant of deep inference (inference rules are allowed to apply in any formula context) where the relevant formulas in a rule are allowed to be arbitrarily distant. We substantiate the design with a prototype implementation of a linking-based interactive prover for first-order classical linear logic.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00937009
Contributor : Kaustuv Chaudhuri <>
Submitted on : Monday, January 27, 2014 - 4:33:06 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM
Document(s) archivé(s) le : Sunday, April 27, 2014 - 11:16:29 PM

Files

formula_linking.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Kaustuv Chaudhuri. Subformula Linking as an Interaction Method. 4th Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. Springer, 7998, pp.386-401, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-39634-2_28〉. 〈hal-00937009〉

Share

Metrics

Record views

383

Files downloads

105