A calculus for collections and aggregates

  • Kazem Lellahi
  • Val Tannen
Conference paper

DOI: 10.1007/BFb0026993

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1290)
Cite this paper as:
Lellahi K., Tannen V. (1997) A calculus for collections and aggregates. In: Moggi E., Rosolini G. (eds) Category Theory and Computer Science. CTCS 1997. Lecture Notes in Computer Science, vol 1290. Springer, Berlin, Heidelberg

Abstract

We present a calculus that should play for database query languages the same role that the lambda calculus plays for functional programming. For the semantic foundations of the calculus we introduce a new concept: monads enriched with algebraic structure. We model collection types through enriched monads and aggregate operations through enriched monad algebras. The calculus derives program equivalences that underlie a good number of the optimizations used in query languages.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Kazem Lellahi
    • 1
  • Val Tannen
    • 2
  1. 1.LIPN, URA 1507 du CNRSUniversité de Paris 13, Institut GaliléeVilletaneuseFrance
  2. 2.CIS DepartmentUniversity of PennsylvaniaPhiladelphiaUSA

Personalised recommendations