Backward type inference for XML queries
From MaRDI portal
Publication:2182320
DOI10.1016/j.tcs.2020.03.020zbMath1440.68056OpenAlexW2606239137MaRDI QIDQ2182320
Nabil Layaïda, Nils Gesbert, Hyeonseung Im, Pierre Genevès
Publication date: 23 May 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01497857v3/file/tcs2020.pdf
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The time complexity of typechecking tree-walking tree transducers
- Macro forest transducers
- Macro tree transducers
- Typechecking for XML transformers
- XML with data values: Typechecking revisited.
- Simplifying subtyping constraints: a theory
- Tree acceptors and some of their applications
- A Core Calculus for XQuery 3.0
- Semantic subtyping with an SMT solver
- Optimizing XML querying using type-based document projection
- Efficiently Deciding μ-Calculus with Converse over Finite Trees
- XQuery and static typing: tackling the problem of backward axes
- Encyclopedia of Database Systems
- XML Type Checking Using High-Level Tree Transducer
- Semantic subtyping
- Forward node-selecting queries over trees
- The Zipper
- Parametric polymorphism and semantic subtyping
- Combinatorics of Compositions and Words
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- CDuce
- Database Theory - ICDT 2005
- Translations on a context free grammar
- One-unambiguous regular languages
This page was built for publication: Backward type inference for XML queries