Pages that link to "Item:Q870267"
From MaRDI portal
The following pages link to Well-definedness and semantic type-checking for the nested relational calculus (Q870267):
Displaying 6 items.
- The complexity of higher-order queries (Q498405) (← links)
- Conservativity of nested relational calculi with internal generic functions (Q1321813) (← links)
- Well-defined NRC queries can be typed (extended abstract) (Q1799317) (← links)
- On deciding well-definedness for query languages on trees (Q3546341) (← links)
- Polymorphic type inference for the named nested relational calculus (Q5277792) (← links)
- Database Theory - ICDT 2005 (Q5316619) (← links)