1458 search results - page 20 / 292 » Monads for incremental computing |
GI
2009
Springer
15 years 4 months ago
2009
Springer
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
WG
1998
Springer
15 years 3 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
IFIPTCS
2010
14 years 9 months ago
2010
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile object...
FOSSACS
2010
Springer
15 years 6 months ago
2010
Springer
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...