%0 Conference Proceedings
%T Subformula Linking for Intuitionistic Logic with Application to Type Theory
%+ Automatisation et ReprésenTation: fOndation du calcUl et de la déducTion (PARTOUT)
%A Chaudhuri, Kaustuv
%< avec comité de lecture
%( Automated Deduction – CADE 28
%B CADE 2021 - 28th International Conference on Automated Deduction
%C Pittsburgh, PA (Virtual), United States
%I Springer International Publishing
%C Cham
%3 Lecture Notes in Computer Science
%V 12699
%P 200-216
%8 2021-07-12
%D 2021
%R 10.1007/978-3-030-79876-5_12
%Z Computer Science [cs]/Logic in Computer Science [cs.LO]Conference papers
%X 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 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.
%G English
%2 https://inria.hal.science/hal-03528659/document
%2 https://inria.hal.science/hal-03528659/file/paper39_hal.pdf
%L hal-03528659
%U https://inria.hal.science/hal-03528659
%~ X
%~ CNRS
%~ INRIA
%~ LIX
%~ INRIA-SACLAY
%~ X-LIX
%~ X-DEP
%~ X-DEP-INFO
%~ INRIA_TEST
%~ TESTALAIN1
%~ INRIA2
%~ UNIV-PARIS-SACLAY
%~ IP_PARIS
%~ IP_PARIS_COPIE
%~ GS-COMPUTER-SCIENCE