Retracts in Simple Types

Vincent Padovani (1)

1 PPS - Preuves, Programmes et Systèmes

We prove the decidability of the existence of a definable retraction between two given simple types when both types are built over a unique ground type. Instead of defining some extension of a former type system from which these retractions could be inferred, we obtain this result as a corollary of the decidability of the minimal model of simply typed λ-calculus.

Domaines: Logique en informatique [cs.LO]

Vincent Padovani. Retracts in Simple Types. Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, May 2001, Krakow, Poland. pp.376-384. ⟨hal-00527856⟩