UnQL
From MaRDI portal
Software:31841
swMATH20018MaRDI QIDQ31841FDOQ31841
Author name not available (Why is that?)
Cited In (10)
- Frontiers of tractability for typechecking simple XML transformations
- Regular languages with variables on graphs
- Advanced structural joins using element distribution
- Adding regular expressions to graph reachability and pattern queries
- Typechecking top-down XML transformations: Fixed input or output schemas
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
- Structural recursion as a query language on lists and ordered trees
- A class of bounded functions, a database language and an extended lambda calculus
- Title not available (Why is that?)
- Well-definedness and semantic type-checking for the nested relational calculus
This page was built for software: UnQL
