A Church-Style Intermediate Language for ML F

Rémy, Didier; Yakobowski, Boris

doi:10.1007/978-3-642-12251-4_4

Cited by 5 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, the challenge becomes whether all their features can be combined together. This question has in fact already been raised in previous work on MLF [Rémy and Yakobowski, 2010].…”

Section: Introductionmentioning

confidence: 85%

“…Instance-bounded polymorphism. The language xMLF [Rémy and Yakobowski, 2010] is the internal language of MLF which is itself an extension of System F with instance-bounded polymorphism. Instance-bounded polymorphism is a mechanism to delay type instantiation of System F; it is a key to performing type inference in MLF and keeping principal typesgiven optional type annotations of function parameters.…”

Section: Expressiveness Of Parametric F ιmentioning

confidence: 99%

See 1 more Smart Citation

On the power of coercion abstraction

Cretin

Rémy

2012

SIGPLAN Not.

Self Cite

View full text Add to dashboard Cite

Erasable coercions in System F-eta, also known as retyping functions, are well-typed eta-expansions of the identity. They may change the type of terms without changing their behavior and can thus be erased before reduction. Coercions in F-eta can model subtyping of known types and some displacement of quantifiers, but not subtyping assumptions nor certain forms of delayed type instantiation. We generalize F-eta by allowing abstraction over retyping functions. We follow a general approach where computing with coercions can be seen as computing in the lambda-calculus but keeping track of which parts of terms are coercions. We obtain a language where coercions do not contribute to the reduction but may block it and are thus not erasable. We recover erasable coercions by choosing a weak reduction strategy and restricting coercion abstraction to value-forms or by restricting abstraction to coercions that are polymorphic in their domain or codomain. The latter variant subsumes F-eta, F-sub, and MLF in a unified framework.

show abstract

“…Hence, the challenge becomes whether all their features can be combined together. This question has in fact already been raised in previous work on MLF [Rémy and Yakobowski, 2010].…”

Section: Introductionmentioning

confidence: 85%

Section: Expressiveness Of Parametric F ιmentioning

confidence: 99%

On the power of coercion abstraction

Cretin

Rémy

2012

SIGPLAN Not.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The language xMLF [Rémy and Yakobowski 2010] is the internal language of MLF which is itself an extension of System F with instance-bounded polymorphism. Instance-bounded polymorphism is a mechanism to delay type instantiation of System F; it is a key to performing type inference in MLF and keeping principal types-given optional type annotations of function parameters.…”

Section: Expressiveness Of Parametric F ιmentioning

confidence: 99%

On the power of coercion abstraction

Cretin

Rémy

2012

Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Self Cite

View full text Add to dashboard Cite

Erasable coercions in System Fη, also known as retyping functions, are well-typed η-expansions of the identity. They may change the type of terms without changing their behavior and can thus be erased before reduction. Coercions in Fη can model subtyping of known types and some displacement of quantifiers, but not subtyping assumptions nor certain forms of delayed type instantiation. We generalize Fη by allowing abstraction over retyping functions. We follow a general approach where computing with coercions can be seen as computing in the λ-calculus but keeping track of which parts of terms are coercions. We obtain a language where coercions do not contribute to the reduction but may block it and are thus not erasable. We recover erasable coercions by choosing a weak reduction strategy and restricting coercion abstraction to value-forms or by restricting abstraction to coercions that are polymorphic in their domain or codomain. The latter variant subsumes Fη, F<:, and MLF in a unified framework.

show abstract

Harnessing ML F with the Power of System F

Manzonetto¹,

Tranquilli

2010

Mathematical Foundations of Computer Science 2010

View full text Add to dashboard Cite

A Church-Style Intermediate Language for ML F

Cited by 5 publications

References 15 publications

On the power of coercion abstraction

On the power of coercion abstraction

On the power of coercion abstraction

Harnessing ML F with the Power of System F

Contact Info

Product

Resources

About