Free theorems involving type constructor classes: functional pearl Export

@inproceedings{citeulike:5724322, abstract = {Free theorems are a charm, allowing the derivation of useful statements about programs from their (polymorphic) types alone. We show how to reap such theorems not only from polymorphism over ordinary types, but also from polymorphism over type constructors restricted by class constraints. Our prime application area is that of monads, which form the probably most popular type constructor class of Haskell. To demonstrate the broader scope, we also deal with a transparent way of introducing difference lists into a program, endowed with a neat and general correctness proof.}, address = {New York, NY, USA}, author = {Voigtl\"{a}nder, Janis}, booktitle = {ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming}, citeulike-article-id = {5724322}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1596550.1596577}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1596550.1596577}, doi = {10.1145/1596550.1596577}, isbn = {978-1-60558-332-7}, keywords = {bidirectionalization, free-theorems, language-haskell, type-classes}, location = {Edinburgh, Scotland}, pages = {173--184}, posted-at = {2009-09-04 18:40:13}, priority = {2}, publisher = {ACM}, title = {Free theorems involving type constructor classes: functional pearl}, url = {http://dx.doi.org/10.1145/1596550.1596577}, year = {2009} }

TY - CONF ID - citeulike:5724322 L3 - citeulike-article-id:5724322 N2 - Free theorems are a charm, allowing the derivation of useful statements about programs from their (polymorphic) types alone. We show how to reap such theorems not only from polymorphism over ordinary types, but also from polymorphism over type constructors restricted by class constraints. Our prime application area is that of monads, which form the probably most popular type constructor class of Haskell. To demonstrate the broader scope, we also deal with a transparent way of introducing difference lists into a program, endowed with a neat and general correctness proof. CY - Edinburgh, Scotland SN - 978-1-60558-332-7 AD - New York, NY, USA EP - 184 TI - Free theorems involving type constructor classes: functional pearl PB - ACM T2 - ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming SP - 173 KW - bidirectionalization KW - free-theorems KW - language-haskell KW - type-classes AU - Voigtländer, Janis PY - 2009/// UR - http://dx.doi.org/10.1145/1596550.1596577 ER -