4617 search results - page 372 / 924 » Automation of Diagrammatic Reasoning |
127
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
We define a hierarchy of term systems Tk by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove Tk NCk Tk+1 , for ...
193
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
166
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
151
click to vote
FLOPS
2006
Springer
15 years 10 months ago
2006
Springer
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
170
click to vote
FLOPS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...