Skip to main content
Article thumbnail
Location of Repository

Strong Normalisation of Cut-Elimination that Simulates β-Reduction

By Kentaro Kikuchi and Stéphane Lengrand

Abstract

This paper is concerned with strong normalisation of cutelimination for a standard intuitionistic sequent calculus. The cutelimination procedure is based on a rewrite system for proof-terms with cut-permutation rules allowing the simulation of β-reduction. Strong normalisation of the typed terms is inferred from that of the simply-typed λ-calculus, using the notions of safe and minimal reductions as well as a simulation in Nederpelt-Klop’s λI-calculus. It is also shown that the type-free terms enjoy the preservation of strong normalisation (PSN) property with respect to β-reduction in an isomorphic image of the typefree λ-calculus

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.9452
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.lix.polytechnique.f... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.