Equality is typable in Semi-Full Pure Type Systems Vincent Siles Hugo Herbelin Ecole Polytechnique / INRIA / Laboratoire PPS INRIA / Laboratoire PPS Equipe πr2 Equipe πr2 23 avenue d’Italie, 75013 Paris, France 23 avenue d’Italie, 75013 Paris, France
[email protected] [email protected] Abstract—There are two usual ways to describe equality in Surprisingly, showing the equivalence between those two a dependent typing system, one that uses an external notion definitions is difficult. Geuvers and Werner [7] early noticed of computation like beta-reduction, and one that introduces a that being able to lift an untyped equality to a typed one, typed judgement of beta-equality directly in the typing system. After being an open problem for some time, the general i.e. to turn a system with β-conversion into a system with equivalence between both approaches has been solved by judgmental equality requires to show Subject Reduction in Adams for a class of pure type systems (PTSs) called functional. the latter system: In this paper, we relax the functionality constraint and prove the equivalence for all semi-full PTSs by combining the ideas If Γ `e M : A and M β N then Γ `e M = N : A. of Adams with a study of the general shape of types in PTSs. As one application, an extension of this result to systems Subject Reduction requires the injectivity of dependent A with sub-typing would be a first step toward bringing closer products Πx :B : the theory behind a proof assistant such as Coq to its A C implementation.