论文信息 - Retracts in Simple Types

Retracts in Simple Types

In this paper we prove the decidability of the existence of a definable retraction between two given simple types. 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.

Vincent Padovani

[1] Manfred Schmidt-Schauß,et al. Decidability of Behavioural Equivalence in Unary PCF , 1999, Theor. Comput. Sci..

[2] Kim B. Bruce,et al. Provable isomorphisms and domain equations in models of typed languages , 1985, STOC '85.

[3] Vincent Padovani,et al. Decidability of All Minimal Models , 1995, TYPES.

[4] Mariangiola Dezani-Ciancaglini,et al. Characterization of Normal Forms Possessing Inverse in the lambda-beta-eta-Calculus , 1976, Theor. Comput. Sci..