1458 search results - page 107 / 292 » Monads for incremental computing |
152
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
131
Voted
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
126
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
222
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
125
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...