Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-28T17:26:58.838Z Has data issue: false hasContentIssue false
  • English
  • Français

Terminating comprehensions

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 November 2008

Chris Reade
Chris Reade
Affiliation:
Computer Science Department, Brunel University, Uxbridge, Middx. UB8 3PH, UK S.E.D. Informatics Department, Rutherford Appleton Laboratory, Chilton, Didcot, Oxon OX11 0QX, UK
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Articles
Information
Journal of Functional Programming , Volume 3 , Issue 2 , April 1993 , pp. 247 - 250
Copyright
Copyright © Cambridge University Press 1993

References

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

Discussions

No Discussions have been published for this article.