Sciweavers

1458 search results - page 1 / 292
» Monads for incremental computing
Sort
View
TCS
2010
13 years 2 months ago
Monad transformers as monoid transformers
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...
Mauro Jaskelioff, Eugenio Moggi
ICFP
2002
ACM
14 years 7 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
BIRTHDAY
2010
Springer
13 years 4 months ago
On Monadic Theories of Monadic Predicates
Pioneers of logic, among them J.R. B
Wolfgang Thomas
FOSSACS
2011
Springer
12 years 11 months ago
Coalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
Bart Jacobs
ICFP
2006
ACM
14 years 7 months ago
Programming monads operationally with Unimo
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...
Chuan-Kai Lin