On the bright side of type classes

DOI10.1145/2034773.2034796zbMath1323.68108OpenAlexW4213453328MaRDI QIDQ5176970

Frank Piessens, Dominique Devriese

Publication date: 5 March 2015

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

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

zbMATH Keywords

Agdatype classesad hoc polymorphisminstance arguments

Mathematics Subject Classification ID

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

Related Items (6)

Eliminating dependent pattern matching without K ⋮ Programming with ornaments ⋮ Unnamed Item ⋮ COCHIS: Stable and coherent implicits ⋮ Formalizing constructive projective geometry in Agda ⋮ Taming the Merge Operator

Uses Software

• Coq
• Haskell
• Scala
• Agda
• RepLib

This page was built for publication: On the bright side of type classes