# A Generic Normalisation Proof for Pure Type Systems

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.
Keywords :
Document type :
Reports
Domain :

https://hal.inria.fr/inria-00073135
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:57:32 AM
Last modification on : Thursday, January 7, 2021 - 11:40:03 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:35:27 PM

### Identifiers

• HAL Id : inria-00073135, version 1

### Citation

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

Record views