Database Theory - ICDT 2005
From MaRDI portal
Publication:5316601
Recommendations
- Frontiers of tractability for typechecking simple XML transformations
- On the complexity of typechecking top-down XML transformations
- Typechecking for XML transformers
- XML Type Checking Using High-Level Tree Transducer
- Typechecking top-down XML transformations: Fixed input or output schemas
- scientific article; zbMATH DE number 1949611
- Programming Languages and Systems
- XML with data values: Typechecking revisited.
- Modulo constraints and the complexity of typechecking XML views
- scientific article; zbMATH DE number 1954116
Cited in
(8)- XML graphs in program analysis
- Frontiers of tractability for typechecking simple XML transformations
- Typechecking for XML transformers
- Typechecking top-down XML transformations: Fixed input or output schemas
- Typed iterators for XML
- A simple and efficient step towards type-correct XSLT transformations
- Backward type inference for XML queries
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
This page was built for publication: Database Theory - ICDT 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316601)