HAL : inria-00497177, version 2

DOI : 10.1017/S0956796812000044

Voir la fiche détaillée

BibTeX,EndNote,... BibTeX - EndNote - TEI - RefWorks -

Journal of Functional Programming 22, 2 (2012) 153 - 180

Versions disponibles

v1 (02-07-2010)

v2 (18-12-2011)

Pure Type System conversion is always typable

Vincent Siles 1, 2, 3, Hugo Herbelin 1, 2

(10/05/2012)

Pure Type Systems are usually described in two different ways, one that uses an external notion of computation like beta-reduction, and one that relies on a typed judgment of equality, directly in the typing system. For a long time, the question was open to know whether both presentations described the same theory. A first step toward this equivalence has been made by Adams for a particular class of \emph{Pure Type Systems} (PTS) called functional. Then, his result has been relaxed to all semi-full PTS in previous work. In this paper, we finally give a positive answer to the general issue, and prove that equivalence holds for any Pure Type System.

1 :	Preuves, Programmes et Systèmes (PPS)
	CNRS : UMR7126 – Université Paris VII - Paris Diderot
2 :	PI.R2 (INRIA Paris - Rocquencourt)
	INRIA – Université Paris VII - Paris Diderot – CNRS : UMR7126
3 :	Laboratoire d'informatique de l'école polytechnique (LIX)
	CNRS : UMR7161 – Polytechnique - X

Domaine

:

Informatique/Langage de programmation

Mots-clés : Pure Type System – Judgemental Equality – Church-Rosser – Subject Reduction – Injectivity

inria-00497177, version 2

http://hal.inria.fr/inria-00497177

oai:hal.inria.fr:inria-00497177

Contributeur : Vincent Siles <>

Soumis le : Dimanche 18 Décembre 2011, 10:10:40

Dernière modification le : Vendredi 11 Mai 2012, 10:55:05