### Abstract

Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining such sequent calculi for Pure Type Systems (PTS, which were originally presented in natural deduction style) and then organizing their rules for effective proof-search. We introduce the idea of Pure Type Sequent Calculus with meta-variables (PTSCα), by enriching the syntax of a permutation-free sequent calculus for propositional logic due to Herbelin, which is strongly related to natural deduction and already well adapted to proof-search. The operational semantics is adapted from Herbelin's and is defined by a system of local rewrite rules as in cut-elimination, using explicit substitutions. We prove confluence for this system. Restricting our attention to PTSC, a type system for the ground terms of this system, we obtain the Subject Reduction property and show that each PTSC is logically equivalent to its corresponding PTS, and the former is strongly normalisingiff the latter is. We show how to make the logical rules of PTSC into a syntax-directed system PS for proof-search, by incorporating the conversion rules as in syntax-directed presentations of the PTS rules for type-checking. Finally, we consider how to use the explicitly scoped meta-variables of PTSC_ to represent partial proof-terms, and use them to analyse interactive proof construction. This sets up a framework PE in which we are able to study proof-search strategies, type inhabitant enumeration and (higher-order) unification. S. Lengrand, R. Dyckhoff, and J. McKinna.

Original language | English |
---|---|

Article number | 6 |

Journal | Logical Methods in Computer Science |

Volume | 7 |

Issue number | 1 |

DOIs | |

Publication status | Published - 23 Mar 2011 |

### Keywords

- Interactive proof construction
- Metavariables
- Proof-search
- Pts
- Sequent calculus
- Strong normalisation
- Type theory

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'A focused sequent calculus framework for proof-search in pure type systems'. Together they form a unique fingerprint.

## Cite this

*Logical Methods in Computer Science*,

*7*(1), [6]. https://doi.org/10.2168/LMCS-7(1:6)2011