Positive Higher−Order Queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed Lambda-calculus. Our language allows one to succinctly define ordinary positive relational algebra queries (conjunctive queries and unions of conjunctive queries) and, in add...
Main Authors: | Benedikt, M, Puppis, G, Vu, H |
---|---|
Format: | Journal article |
Published: |
2010
|
Similar Items
-
Complexity of Higher−Order Queries
by: Vu, H, et al.
Published: (2011) -
Higher-order queries and applications
by: Vu, Q
Published: (2012) -
Querying visible and invisible information
by: Benedikt, M, et al.
Published: (2016) -
Strongly-Normalizing Higher-Order Relational Queries
by: Wilmer Ricciotti, et al.
Published: (2022-08-01) -
Higher−Order Functions and Structured Datatypes
by: Benedikt, M, et al.
Published: (2012)