A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems Stéphane Lengrand, Roy Dyckhoff, James Mckinna To cite this version: Stéphane Lengrand, Roy Dyckhoff, James Mckinna. A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2011, 7 (1), pp.33. 10.2168/LMCS-7(1:6)2011. hal-01110478 HAL Id: hal-01110478 https://hal.archives-ouvertes.fr/hal-01110478 Submitted on 28 Jan 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution - NonCommercial - ShareAlike| 4.0 International License A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems Stéphane Lengrand1, Roy Dyckho2 and James McKinna3 1CNRS, École Polytechnique, France.
[email protected] 2School of Computer Science, University of St Andrews, Scotland.
[email protected] 3Radboud University, Nijmegen, The Netherlands.
[email protected] 3rd October 2009 Abstract Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules.