Type classes with more higher-order polymorphism

DOI10.1145/581478.581496zbMath1322.68046OpenAlexW2119717275MaRDI QIDQ2949205

Peter Thiemann, Matthias Neubauer

Publication date: 7 October 2015

Published in: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/581478.581496

zbMATH Keywords

Haskellhigher-order unificationtype inferencetype classes

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Iteration and coiteration schemes for higher-order and nested datatypes

Uses Software

• Haskell

This page was built for publication: Type classes with more higher-order polymorphism