507 search results - page 27 / 102 » Normalization Theory for XML |
PLANX
2008
13 years 9 months ago
2008
Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provi...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
SIGCSE
1997
ACM
13 years 12 months ago
1997
ACM
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...