Adding structure to monoids: thus hopefully ending Haskell's string type confusion

Authors:
Mario BlaĚević
Affiliations:
Stilo International plc., Ottawa, ON, Canada
Venue:
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
Year:
2013

Citing 6
Cited 0

SNOBOL , A String Manipulation Language

Journal of the ACM (JACM)
ICON Programmng Language

ICON Programmng Language
A history of Haskell: being lazy with class

Proceedings of the third ACM SIGPLAN conference on History of programming languages
Stream fusion on haskell unicode strings

IFL'09 Proceedings of the 21st international conference on Implementation and application of functional languages
Rewriting haskell strings

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
Iteratees

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the rationale and design of monoid-subclasses. This Haskell library consists of a collection of type classes that generalize the interface of several common data types, most importantly those used to represent strings. We demonstrate that the mathematical theory behind monoid-subclasses can bring substantial practical benefits to the Haskell library ecosystem by generalizing attoparsec, one of the most popular Haskell parsing libraries.