Recasting ML\(^{\text F}\)
From MaRDI portal
Publication:1023287
DOI10.1016/J.IC.2008.12.006zbMath1167.68014OpenAlexW2911299022MaRDI QIDQ1023287
Publication date: 11 June 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.12.006
Related Items (3)
Ambivalent Types for Principal Type Inference with GADTs ⋮ A Church-style intermediate language for ML\(^{\text F}\) ⋮ Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polymorphic type inference and containment
- Unification under a mixed prefix
- A theory of type polymorphism in programming
- Typability and type checking in System F are equivalent and undecidable
- Bounded quantification is undecidable
- Semi-explicit first-class polymorphism for ML.
- Qualified types for MLF
- Practical type inference for arbitrary-rank types
- A Church-Style Intermediate Language for ML F
- A type directed translation of MLF to system F
- From ML to ML F
- HMF
- FPH
- Colored local type inference
- ML F
- Flexible types
- Programming Languages and Systems
- Stratified type inference for generalized algebraic data types
- Boxy types
This page was built for publication: Recasting ML\(^{\text F}\)
