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 metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01093216
Contributor : Didier Rémy <>
Submitted on : Wednesday, December 10, 2014 - 6:28:58 PM
Last modification on : Friday, May 25, 2018 - 12:02:07 PM
Long-term archiving on : Wednesday, March 11, 2015 - 11:01:05 AM

File

DidierRemyCoercions.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01093216, version 1

Collections

Citation

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, ⟨Microsoft Research⟩, 2014, TechReport. ⟨hal-01093216⟩

Share

Metrics

Record views

114

Files downloads

131