Pages that link to "Item:Q696968"
From MaRDI portal
The following pages link to Polymorphic type inference for the relational algebra (Q696968):
Displayed 4 items.
- Relational lattices: from databases to universal algebra (Q299191) (← links)
- The complexity of higher-order queries (Q498405) (← links)
- On the complexity of deciding typability in the relational algebra (Q1777227) (← links)
- Towards a Type Discipline for Answer Set Programming (Q3638249) (← links)