Polymorphic type inference for the relational algebra

DOI10.1006/JCSS.2001.1812zbMath1015.68062OpenAlexW1500120746MaRDI QIDQ696968

Jan Van den Bussche, Emmanuel Waller

Publication date: 12 September 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2001.1812

zbMATH Keywords

complexitypolymorphic expressive power

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (4)

Relational lattices: from databases to universal algebra ⋮ The complexity of higher-order queries ⋮ On the complexity of deciding typability in the relational algebra ⋮ Towards a Type Discipline for Answer Set Programming

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polymorphic type inference for the relational algebra