Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus

Author Kentaro Kikuchi



PDF
Thumbnail PDF

File

LIPIcs.CSL.2013.395.pdf
  • Filesize: 0.56 MB
  • 20 pages

Document Identifiers

Author Details

Kentaro Kikuchi

Cite AsGet BibTex

Kentaro Kikuchi. Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus. In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 395-414, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.CSL.2013.395

Abstract

In this paper we present strong normalisation proofs using a technique of non-deterministic translations into Klop's extended lambda-calculus. We first illustrate the technique by showing strong normalisation of a typed calculus that corresponds to natural deduction with general elimination rules. Then we study its explicit substitution version, the type-free calculus of which does not satisfy PSN with respect to reduction of the original calculus; nevertheless it is shown that typed terms are strongly normalising with respect to reduction of the explicit substitution calculus. In the same framework we prove strong normalisation of Sørensen and Urzyczyn's cut-elimination system in intuitionistic sequent calculus.
Keywords
  • Strong normalisation
  • Klop's extended lambda-calculus
  • Explicit substitution
  • Cut-elimination

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail