STRINGOLOGY
2008
14 years 1 months ago
2008
In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bit-parall...
PLANX
2008
14 years 1 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...
PLANX
2008
14 years 1 months ago
2008
Event-based processing of XML data
PLANX
2008
14 years 1 months ago
2008
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
PLANX
2008
14 years 1 months ago
2008
PLANX
2008
14 years 1 months ago
2008
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
PLANX
2008
14 years 1 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
PLANX
2008
14 years 1 months ago
2008
We present an initial attempt at providing a formal specification for a mini
ESOP
2008
Springer
14 years 1 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
ESOP
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...