1458 search results - page 16 / 292 » Monads for incremental computing |
GG
2004
Springer
14 years 3 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
BIRTHDAY
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
CSR
2008
Springer
13 years 11 months ago
2008
Springer
We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of langu...
POPL
2009
ACM
14 years 10 months ago
2009
ACM
We develop a model of concurrent imperative programming with threads. We focus on a small imperative language with cooperative threads which execute without interruption until the...
LICS
2008
IEEE
14 years 4 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...