1458 search results - page 2 / 292 » Monads for incremental computing |
ICFP
2002
ACM
14 years 5 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 ...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, an...
FOSSACS
2010
Springer
14 years 4 days ago
2010
Springer
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
ESOP
2009
Springer
14 years 2 days ago
2009
Springer
Abstract. During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical n...
ENTCS
2011
12 years 8 months ago
2011
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and McBride and Paterson’s idioms (also called applicative functors). We show...