Comprehensive comprehensions

Simon L. Peyton Jones; Philip Wadler

doi:10.1145/1291201.1291209

Comprehensive comprehensions

Simon L. Peyton Jones, Philip Wadler

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

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.

Original language	English
Title of host publication	Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2007, Freiburg, Germany, September 30, 2007
Pages	61-72
Number of pages	12
DOIs	https://doi.org/10.1145/1291201.1291209
Publication status	Published - 2007

Access to Document

10.1145/1291201.1291209

Jones Wadler 2007 Conprehensive ComprehensionsFinal published version, 227 KB

http://doi.acm.org/10.1145/1291201.1291209

Cite this

@inproceedings{fb4cf76217674e32a67f3ef080a0c4af,

title = "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.",

author = "Jones, {Simon L. Peyton} and Philip Wadler",

year = "2007",

doi = "10.1145/1291201.1291209",

language = "English",

pages = "61--72",

booktitle = "Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2007, Freiburg, Germany, September 30, 2007",

}

TY - GEN

T1 - Comprehensive comprehensions

AU - Jones, Simon L. Peyton

AU - Wadler, Philip

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

U2 - 10.1145/1291201.1291209

DO - 10.1145/1291201.1291209

M3 - Conference contribution

SP - 61

EP - 72

BT - Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2007, Freiburg, Germany, September 30, 2007

ER -

Comprehensive comprehensions

Abstract / Description of output

Access to Document

Fingerprint

Cite this