Subformula Linking for Intuitionistic Logic with Application to Type Theory
Open Access
- 5 July 2021
- book chapter
- Published by Springer Nature
- p. 200-216
Abstract
Subformula linking is an interactive theorem proving technique that was initially proposed for (classical) linear logic. It is based on truth and context preserving rewrites of a conjecture that are triggered by a user indicatinglinksbetween subformulas, which can be done by direct manipulation, without the need of tactics or proof languages. The system guarantees that a true conjecture can always be rewritten to a known, usually trivial, theorem. In this work, we extend subformula linking to intuitionistic first-order logic with simply typed lambda-terms as the term language of this logic. We then use a well known embedding of intuitionistic type theory into this logic to demonstrate one way to extend linking to type theory.Keywords
This publication has 16 references indexed in Scilit:
- Subformula Linking as an Interaction Method2013
- A Two-Level Logic Approach to Reasoning About ComputationsJournal of Automated Reasoning, 2011
- Focusing and polarization in linear, intuitionistic, and classical logicsTheoretical Computer Science, 2009
- A Logical Characterization of Forward and Backward Chaining in the Inverse MethodJournal of Automated Reasoning, 2008
- Local type inferenceACM Transactions on Programming Languages and Systems, 2000
- System Description: Twelf — A Meta-Logical Framework for Deductive Systems1999
- A framework for defining logicsJournal of the ACM, 1993
- Logic Programming with Focusing Proofs in Linear LogicJournal of Logic and Computation, 1992
- Encoding a dependent-type λ-calculus in a logic programming language1990
- Higher-order abstract syntaxACM SIGPLAN Notices, 1988