Skip to main content Accessibility help
×
×
Home

Terminating comprehensions

  • Chris Reade (a1) (a2)
Abstract

List terminators are discussed as a new form of qualifier in list comprehensions for early termination of a list. The semantics of list terminators is expressed in terms of an optimal translation of list comprehensions (cf. Wadler, 1987) because it makes direct use of a continuation list.

Copyright
References
Hide All
Hudak, P., Peyton Jones, S., Wadler, P. eds. et al. , 1992. The Haskell Report. ACM SIGPLAN Notices, 27(5): 05.
Reade, C. M. P. 1989. Elements of Functional Programming. Addison Wesley.
Wadler, P. 1987. List comprehensions. In S., Peyton Jones ed., The Implementation of Functional Programming Languages. Prentice Hall.
Wadler, P. 1990. Comprehending monads. In Proceedings ACM Conference on Lisp and Functional Programming, Nice, France.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Terminating comprehensions

  • Chris Reade (a1) (a2)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *