Safe zero-cost coercions for Haskell

DOI10.1017/S0956796816000150zbMath1420.68035OpenAlexW2500959965MaRDI QIDQ5371973

Joachim Breitner, Richard Eisenberg, Stephanie Weirich, Simon L. Peyton Jones

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796816000150

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

Monotone recursive types and recursive data representations in Cedille, Unnamed Item

Uses Software

• Ott
• ML
• Haskell
• OCaml
• GHC

Cites Work

• Safe zero-cost coercions for Haskell
• Associated type synonyms
• On the power of coercion abstraction
• Typed compilation of inclusive subtyping
• A Church-Style Intermediate Language for ML F
• <scp>OutsideIn(X)</scp>Modular type inference with local assumptions
• Derivable Type Classes
• Ott: Effective tool support for the working semanticist
• Associated types with class
• GADTs Meet Subtyping
• Closed type families with overlapping equations
• Generative type abstraction and type-level computation