Comprehensive comprehensions

ABSTRACT

We propose an extension to list comprehensions that makes it easy to express the kind of queries one would write in SQL using ORDER BY, GROUP BY, and LIMIT. Our extension adds expressive power to comprehensions, and generalises the SQL constructs that inspired it. It is easy to implement, using simple desugaring rules.

REFERENCES

• 1: Kevin Beyer , Don Chambérlin , Latha S. Colby , Fatma Özcan , Hamid Pirahesh , Yu Xu, Extending XQuery for analytics, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland [doi>10.1145/1066157.1066215]
• 2: Scott Boag, Don Chameberlin, Mary F. Fernández, Daniela Florescu, Jonathan Robie, and Jérome Siméon. Xquery 1.0: An xml query language. Technical report, W3C Recommendation, January 2007. URL http://www.w3.org/TR/2007/REC-xquery-20070123/.
• 3: Peter Buneman , Leonid Libkin , Dan Suciu , Val Tannen , Limsoon Wong, Comprehension syntax, ACM SIGMOD Record, v.23 n.1, p.87-96, March 1994 [doi>10.1145/181550.181564]
• 4: Ezra Cooper, Sam Lindley, Philip Wadler, and Jeremy Yallop. Links: Web programming without tiers. In Formal Methods for Components and Objects. Springer Verlag, October 2006.
• 5: John Darlington. Program transformation and synthesis: Present capabilities. Technical Report Report 77/43, Imperial College of Science and Technology, London, September 1977.
• 6: Michael Kay. Positional grouping in XQuery. In Third International Workshop on XQuery Implementation, Experiences, and Perspectives (XIME-P). ACM Press, June 2006.
• 7: Daan Leijen , Erik Meijer, Domain specific embedded compilers, Proceedings of the 2nd conference on Domain-specific languages, p.109-122, October 03-06, 1999, Austin, Texas, United States
• 8: Håkan Mattsson , Hans Nilsson , Claes Wikstrom, Mnesia - A Distributed Robust DBMS for Telecommunications Applications, Proceedings of the First International Workshop on Practical Aspects of Declarative Languages, p.152-163, January 18-19, 1999
• 9: Erik Meijer , Brian Beckman , Gavin Bierman, LINQ: reconciling object, relations and XML in the .NET framework, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, June 27-29, 2006, Chicago, IL, USA [doi>10.1145/1142473.1142552]
• 10: J. C. Reynolds. Types, abstraction and parametric polymorphism. In REA Mason, editor, Information Processing 83, pages 513--523. North-Holland, 1983.
• 11: Phil Trinder and Philip Wadler. Improving list comprehension database queries. In Fourth IEEE Region 10 Conference (TENCON), pages 186--192. IEEE, November 1989.
• 12: Philip Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2: 461--493, 1992.
• 13: Philip Wadler. List comprehensions. In Simon Peyton Jones, editor, The Implementation of Functional Programming Languages, pages 127--138. Prentice Hall, 1987.
• 14: Philip Wadler, Theorems for free!, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.347-359, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99404]
• 15: Limsoon Wong, Kleisli, a functional query system, Journal of Functional Programming, v.10 n.1, p.19-56, January 2000 [doi>10.1017/S0956796899003585]

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Data types and structures

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.3 Languages
          Subjects: Query languages

General Terms:
Languages, Theory

Keywords:
SQL, aggregate, list comprehension, query