Hostname: page-component-6bb9c88b65-2jdt9 Total loading time: 0 Render date: 2025-07-27T05:11:17.893Z Has data issue: false hasContentIssue false
  • English
  • Français

THEORETICAL PEARLS

Flattening combinators: surviving without parentheses

Published online by Cambridge University Press:  25 June 2003

CHRIS OKASAKI
CHRIS OKASAKI
Affiliation:
United States Military Academy,
The views expressed in this article are those of the author and do not reflect the official policy or position of the United States Military Academy, the Department of the Army, the Department of Defense, or the U.S. Government.
West Point, New York, NY, USA (email: Christopher.Okasaki@usma.edu)
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.

A combinator expression is flat if it can be written without parentheses, that is, if all applications nest to the left, never to the right. This note explores a simple method for flattening combinator expressions involving arbitrary combinators.

Information

Type
Theoretical Pearls
Information
Journal of Functional Programming , Volume 13 , Issue 4 , July 2003 , pp. 815 - 822
Copyright
© 2003 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.