3440 search results - page 431 / 688 » Logics For Context-Free Languages |
180
click to vote
IGPL
2008
15 years 6 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
275
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
186
click to vote
PODS
2007
ACM
16 years 7 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�...
170
click to vote
ICFP
2003
ACM
16 years 7 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
270
click to vote
SOFSEM
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...