Haskell type constraints unleashed

DOI10.1007/978-3-642-12251-4_6MaRDI QIDQ3558329zbMATH OpenOpenAlexFDO

Authors Dominic Orchard, Tom Schrijvers

Publication date 4 May 2010

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://kar.kent.ac.uk/57498/1/constraint-families.pdf

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20)

Recommendations

• Type classes with more higher-order polymorphism
• Fun with type functions
• Type checking with open type functions
• Closed type families with overlapping equations
• Deconstraining DSLs

Cited in

(14)

• Proving type class laws for Haskell
• Practical Optional Types for Clojure
• Type Class Instances for Type-Level Lambdas in Haskell
• Fun with type functions
• Understanding functional dependencies via constraint handling rules
• Type-safe pattern combinators
• Parametricity for Haskell with Imprecise Error Semantics
• scientific article; zbMATH DE number 4106298 (Why is no real title available?)
• Constraint handling rules with binders, patterns and generic quantification
• Deconstraining DSLs
• Type checking with open type functions
• The constrained-monad problem
• Closed type families with overlapping equations
• Domain-specific tensor languages

Describes a project that uses

Uses Software

• Haskell
• GHC

This page was built for publication: Haskell type constraints unleashed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558329)