A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Details A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

2010-12-15

arxiv.org/abs/1012.3372v2

LMCS 7 (1:6) 2011

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-7(1:6)2011

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 (PTSCalpha), 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 normalising iff 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 PTSCalpha 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.

Affiliated with

Also associated with

No associations

Rating

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14192