Type-safe pattern combinators

DOI10.1017/S0956796808007089MaRDI QIDQ3616444zbMATH OpenFDO

Authors Morten Rhiger

Publication date 25 March 2009

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1629944
• scientific article; zbMATH DE number 1692906
• Mechanisms for improved covariant type-checking
• Haskell type constraints unleashed
• Proving type class laws for Haskell

Cites work

• scientific article; zbMATH DE number 1487847 (Why is no real title available?)
• Do we need dependent types?
• Encoding types in ML-like languages
• Functional unparsing
• Proceedings of the second ACM SIGPLAN international conference on Functional programming

Cited in

(9)

• Understanding beginners' mistakes with Haskell
• A typed pattern calculus
• Practical Variable-Arity Polymorphism
• Pattern matching for the masses using custom notations
• High-level views on low-level representations
• scientific article; zbMATH DE number 1629944 (Why is no real title available?)
• Towards the essence of hygiene
• Type Inference of Simple Recursive Functions in Scala
• ``Little language project modules

This page was built for publication: Type-safe pattern combinators

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