A Sequent Calculus for Type Theory

Stéphane Lengrand, Roy Dyckhoff, James McKinna

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationComputer Science Logic. CSL 2006
PublisherSpringer
Pages441-455
Number of pages15
ISBN (Electronic)9783540454595
ISBN (Print)9783540454588
DOIs
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science
Volume4207
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint Dive into the research topics of 'A Sequent Calculus for Type Theory'. Together they form a unique fingerprint.

  • Cite this

    Lengrand, S., Dyckhoff, R., & McKinna, J. (2006). A Sequent Calculus for Type Theory. In Computer Science Logic. CSL 2006 (pp. 441-455). (Lecture Notes in Computer Science; Vol. 4207). Springer. https://doi.org/10.1007/11874683_29