2911 search results - page 85 / 583 » A Theory of Expressiveness in Mechanisms |
275
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
159
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
169
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
176
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
163
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...