A Generic Normalisation Proof for Pure Type Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

A Generic Normalisation Proof for Pure Type Systems

Paul-André Melliès

Abstract

We prove the strong normalisation for any PTS, provided the existence of a certain $\Lambda$-set $\A for every sort s of the system. The properties verified by the $\A's depend of the axioms and rules of the type system. A slightly shortened version of this work has been published under the same title in the volume «Types for Proofs and Programs», Internatio- nal workshop TYPES'96, E. Gimenez and C. Paulin-Mohring Eds, LNCS 1512, Springer-Verlag, 1998.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3548.pdf (558.14 Ko) Télécharger le fichier

Dates and versions

inria-00073135 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073135 , version 1

Cite

Paul-André Melliès, Benjamin Werner. A Generic Normalisation Proof for Pure Type Systems. [Research Report] RR-3548, INRIA. 1998. ⟨inria-00073135⟩
99 View
427 Download

Share

Gmail Facebook X LinkedIn More