The following pages link to UnQL (Q31841):
Displayed 10 items.
- Regular languages with variables on graphs (Q418127) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- Adding regular expressions to graph reachability and pattern queries (Q1762201) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- A class of bounded functions, a database language and an extended lambda calculus (Q2402281) (← links)
- Advanced structural joins using element distribution (Q2509239) (← links)
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← links)
- (Q5014444) (← links)