https://inria.hal.science/hal-03528659Chaudhuri, KaustuvKaustuvChaudhuriPARTOUT - Automatisation et ReprésenTation: fOndation du calcUl et de la déducTion - LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau] - X - École polytechnique - CNRS - Centre National de la Recherche Scientifique - Inria Saclay - Ile de France - Inria - Institut National de Recherche en Informatique et en AutomatiqueSubformula Linking for Intuitionistic Logic with Application to Type TheoryHAL CCSD2021[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]Chaudhuri, Kaustuv2022-01-18 19:51:172023-03-24 14:53:252022-01-19 09:07:38enConference papershttps://inria.hal.science/hal-03528659/document10.1007/978-3-030-79876-5_12application/pdf1Abstract 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 indicating links between 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.