A Sequent Calculus for Type Theory

Abstract : Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent Calculi (PTSC) by enriching a sequent calculus due to Herbelin, adapted to proof-search and strongly related to natural deduction. PTSC are equipped with a normalisation procedure, adapted from Herbelin's and defined by local rewrite rules as in Cut-elimination, using explicit substitutions. It satisfies Subject Reduction and it is confluent. A PTSC is logically equivalent to its corresponding PTS, and the former is strongly normalising if and only if the latter is. We show how the conversion rules can be incorporated inside logical rules (as in syntax-directed rules for type checking), so that basic proof-search tactics in type theory are merely the root-first application of our inference rules.
Type de document :
Communication dans un congrès
Zoltan Esik. Computer Science Logic (CSL'06), Sep 2006, Szeged, Hungary. Springer-Verlag, pp.441 - 455, 2006, LNCS, volume 4207


https://hal.archives-ouvertes.fr/hal-00150286
Contributeur : Stéphane Graham-Lengrand <>
Soumis le : mercredi 30 mai 2007 - 02:16:38
Dernière modification le : mardi 11 octobre 2016 - 13:59:24

Identifiants

  • HAL Id : hal-00150286, version 1

Collections

PPS | USPC

Citation

Stéphane Lengrand, Roy Dyckhoff, James Mckinna. A Sequent Calculus for Type Theory. Zoltan Esik. Computer Science Logic (CSL'06), Sep 2006, Szeged, Hungary. Springer-Verlag, pp.441 - 455, 2006, LNCS, volume 4207. <hal-00150286>

Exporter

Partager

Métriques

Consultations de la notice

308