4757 search results - page 6 / 952 » Monads for Functional Programming |
FPLE
1995
13 years 11 months ago
1995
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
HASKELL
2008
ACM
13 years 8 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
IPMU
2010
Springer
13 years 6 months ago
2010
Springer
Are we interested in choice functions or function for choice? Was it my choice or did I choose? In the end it is all about sorts and operators, terms as given by the term monad ove...