677 search results - page 2 / 136 » The XML Typechecking Problem |
PODS
2007
ACM
14 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�...
WWW
2007
ACM
14 years 7 months ago
2007
ACM
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
PODS
2001
ACM
14 years 6 months ago
2001
ACM
CSL
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
ICDT
2007
ACM
14 years 12 days ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....