Proceedings paper
Title:
The F# Computation Expression Zoo
Authors:
T. Petříček, D. Syme
Publication:
Practical Aspects of Declarative Languages
Year:
2014
ISBN:
978-3-319-04132-2
Abstract:
Program logic can often be structured using abstract computation types such as monoids, monad transformers or applicative functors. Functional programmers use those abstractions directly while main-stream languages often integrate concrete instances as language features – e.g. generators in Python or asynchronous computations in C# 5.0. The question is, is there a sweet spot between convenient, hardwired language features, and an inconvenient but flexible libraries?
BibTeX:
@inproceedings{petricek_f_2014, title = {{The F\# Computation Expression Zoo}}, author = {Petricek, Tomas and Syme, Don}, year = {2014}, booktitle = {{Practical Aspects of Declarative Languages}}, editor = {Flatt, Matthew and Guo, Hai-Feng}, publisher = {Springer International Publishing}, series = {{Lecture Notes in Computer Science}}, location = {Cham}, doi = {10.1007/978-3-319-04132-2_3}, isbn = {978-3-319-04132-2}, pages = {33--48}, }