Hostname: page-component-745bb68f8f-d8cs5 Total loading time: 0 Render date: 2025-01-26T03:46:42.550Z Has data issue: false hasContentIssue false
  • English
  • Français

Special issue on Algorithmic aspects of functional programming languages

Published online by Cambridge University Press:  29 August 2001

CHRIS OKASAKI
CHRIS OKASAKI
Affiliation:
Department of Computer Science, Columbia University, NY, USA (e-mail: [email protected])
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.

Algorithms can be dramatically affected by the language in which they are implemented. An algorithm that is elegant and efficient in one language may be ugly and inefficient in another. If you have ever attempted to implement an assignment-intensive algorithm in a functional programming language, you are probably more familiar with this phenomenon than you ever wanted to be! But this sword does not cut in only one direction. Functional programming languages are wonderfully suited to expressing certain kinds of algorithms in a clean, modular way, and researchers over the last five to ten years have greatly expanded the range of algorithms for which this is true.

Type
Editorial
Information
Journal of Functional Programming , Volume 11 , Issue 5 , September 2001 , pp. 439 - 440
Copyright
© 2001 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.