Ambivalent Types for Principal Type Inference with GADTs
From MaRDI portal
Publication:2937793
DOI10.1007/978-3-319-03542-0_19zbMath1426.68046OpenAlexW168996756MaRDI QIDQ2937793
Publication date: 12 January 2015
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03542-0_19
Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Cites Work
- Recasting ML\(^{\text F}\)
- A theory of type polymorphism in programming
- Semi-explicit first-class polymorphism for ML.
- Complete and decidable type inference for GADTs
- Ambivalent Types for Principal Type Inference with GADTs
- Guarded recursive datatype constructors
- Typing dynamic typing
- Programming in Ωmega
- <scp>OutsideIn(X)</scp>Modular type inference with local assumptions
- Stratified type inference for generalized algebraic data types