@inproceedings{cec63c4085d94026bbb158cb75a0e4b8,
title = "A generic normalisation proof for pure type systems",
abstract = "We prove the strong normalisation for any PTS, provided the existence of a certain A-set (Formula presented) for every sort s of the system. The properties verified by the 2lφ(s){\textquoteleft}s depend of the axiom and rules of the type system.",
author = "Melli{\`e}s, \{Paul Andr{\'e}\} and Benjamin Werner",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 1st International Workshop on Types for Proofs and Programs, TYPES 1996 ; Conference date: 15-12-1996 Through 19-12-1996",
year = "1998",
month = jan,
day = "1",
doi = "10.1007/BFb0097796",
language = "English",
isbn = "3540651373",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "254--276",
editor = "Christine Paulin-Mohring and Eduardo Gimenez",
booktitle = "Types for Proofs and Programs - International Workshop TYPES 1996, Selected Papers",
}