A church-style intermediate language for MLF

Rémy, Didier; Yakobowski, Boris

doi:10.1016/j.tcs.2012.02.026

Cited by 4 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The value restriction requires no extension to the library, but the relaxed value restriction [3] would require one: the solver would have to be made aware of the variance of every type constructor. Higher-rank polymorphism [4,16], polymorphism in the style of MLF [21], and GADTs [24,5] would require other extensions, which we have not considered.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Hindley-milner elaboration in applicative style

PottierFrançois

2014

SIGPLAN Not.

View full text Add to dashboard Cite

Type inference-the problem of determining whether a program is well-typed-is well-understood. In contrast, elaboration-the task of constructing an explicitly-typed representation of the programseems to have received relatively little attention, even though, in a non-local type inference system, it is non-trivial. We show that the constraint-based presentation of Hindley-Milner type inference can be extended to deal with elaboration, while preserving its elegance. This involves introducing a new notion of "constraint with a value", which forms an applicative functor.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Technically, one defines [λα.C/x](x τ ) as [τ /α]C; that is, the β-redex (λα.C) τ is reduced on the fly as part of the substitution 2. Rémy and Yakobowski's elaboration of eMLF into xMLF[21] merges the syntax of terms, constraints, and witnesses. Similarly, Gundry suggests "identifying the syntactic and linguistic contexts"[6, §2.4].…”

mentioning

confidence: 99%

Hindley-milner elaboration in applicative style

PottierFrançois

2014

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…Such unidirectional version of Coercible amounts to explicit inclusive subtyping and is more complicated than our current symmetric system: For example, the lifting rule would have to take variance into account: For a type constructor T, does Coercible (T a) (T b) require Coercible a b, or Coercible b a, or both, or neither? Furthermore, we would have to adapt our internal language, FC, to work with explicit subtyping proofs (Crary, 2000;Rémy & Yakobowski, 2010;Cretin & Rémy, 2012).…”

Section: What Else Is There To Coerce?mentioning

confidence: 99%

Safe zero-cost coercions for Haskell

et al. 2016

View full text Add to dashboard Cite

Generative type abstractions -present in Haskell, OCaml, and other languages -are useful concepts to help prevent programmer errors. They serve to create new types that are distinct at compile time but share a run-time representation with some base type. We present a new mechanism that allows for zero-cost conversions between generative type abstractions and their representations, even when such types are deeply nested. We prove type safety in the presence of these conversions and have implemented our work in GHC.

show abstract

“…Rémy and Yakobowski's elaboration of eMLF into xMLF[21] merges the syntax of terms, constraints, and witnesses. Similarly, Gundry suggests "identifying the syntactic and linguistic contexts"[6, §2.4].…”

mentioning

confidence: 99%