663 search results - page 2 / 133 » Interactive Realizers and Monads |
FOSSACS
2009
Springer
14 years 26 days ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
ML
2007
ACM
13 years 5 months ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
BIRTHDAY
2008
Springer
13 years 8 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...
CHI
2006
ACM
14 years 6 months ago
2006
ACM
ESOP
2009
Springer
13 years 10 months ago
2009
Springer
We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include ...