Skip to Main content Skip to Navigation
New interface
Book sections

From Amber to Coercion Constraints

Abstract : 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.
Document type :
Book sections
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Didier Rémy Connect in order to contact the contributor
Submitted on : Wednesday, December 10, 2014 - 6:28:58 PM
Last modification on : Thursday, February 3, 2022 - 11:18:29 AM
Long-term archiving on: : Wednesday, March 11, 2015 - 11:01:05 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads