From Amber to Coercion Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2014

From Amber to Coercion Constraints


Subtyping is a common tool in the design of type systems that finds itsroots in the eta-expansion of arrow types and the notion of typecontainment obtained by closing System Fby eta-expansion. Althoughstrongly related, subtyping and type containment still significantlydiffer from one another when put into practice. We introduce coercionconstraints to relate and generalize subtyping and type containment aswell as all variants of F-bounded quantification and instance-boundedquantification used for first-order type inference in the presence ofsecond-order types. We obtain a type system with a clearer separationbetween computational and erasable parts of terms.
Fichier principal
Vignette du fichier
DidierRemyCoercions.pdf (425.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01093216 , version 1 (10-12-2014)


  • HAL Id : hal-01093216 , version 1


Didier Rémy, Julien Cretin. From Amber to Coercion Constraints. Martin Abadi; Philippa Gardner; Andrew D. Gordon; Radu Mardare. Essays for the Luca Cardelli Fest, MSR-TR-2014-104, Microsoft Research, 2014, TechReport. ⟨hal-01093216⟩


76 View
107 Download


Gmail Facebook X LinkedIn More