50 search results - page 1 / 10 » Monads and Effects |
ICFP
2006
ACM
15 years 10 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
ICFP
2002
ACM
15 years 10 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 ...
WOTUG
2008
14 years 11 months ago
2008
Writing concurrent programs in languages that lack explicit support for concurrency can often be awkward and difficult. Haskell's monads provide a way to explicitly specify se...
CSFW
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This ap...
ICFP
2007
ACM
15 years 10 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...