Database Paper Browser

Back to papers

Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (Extended Abstract)

Summary: Characterizes functional DB query languages as fixed-order typed lambda calculi (TLI_i/MLI_i) with list-based DBs (requiring order ≥3) where queries and databases are lambda terms evaluated by reduction. Proves expressivity/complexity correspondences FO ⊆ TLI_0 ⊆ MLI_0 ⊆ LOGSPACE ⊆ TLI_1=MLI_1=PTIME ⊆ TLI_2 and shows fixed-order ML type inference is polynomial, implying low-order ML-style programs suffice to express efficient queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1033
Venue
PODS
Year
1994
Pagerank
5.0171671e-05
Overall Rank
6,551 | 54.43%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
7,248 Positive Higher-Order Queries 2010 PODS 4.7902631e-05
12,780 On Genericity and Parametricity 1996 PODS 4.1945683e-05
12,828 Tutorial: Languages for Collection Types 1994 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,783 Normal Forms and Conservative Properties for Query Languages over Collection Types 1993 PODS 0.00010568101
1,835 The Expressiveness of a Family of Finite Set Languages 1991 PODS 0.00010375854
Previous Page 1 / 1 Next

Semantically Similar Papers