Sciweavers

1458 search results - page 4 / 292
» Monads for incremental computing
Sort
View
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
14 years 1 months ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring
EUROCAST
2001
Springer
118views Hardware» more  EUROCAST 2001»
14 years 2 months ago
A Language Prototyping Tool Based on Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
José Emilio Labra Gayo, Juan Manuel Cueva L...
ICALP
2007
Springer
14 years 4 months ago
Boundedness of Monadic FO over Acyclic Structures
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very res...
Stephan Kreutzer, Martin Otto, Nicole Schweikardt
CONCUR
2004
Springer
14 years 3 months ago
Message-Passing Automata Are Expressively Equivalent to EMSO Logic
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...
Benedikt Bollig, Martin Leucker
ICFP
2008
ACM
14 years 9 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar