Hostname: page-component-cb9f654ff-p5m67 Total loading time: 0 Render date: 2025-08-21T12:28:34.422Z Has data issue: false hasContentIssue false
  • English
  • Français

FUNCTIONAL PEARL Concurrent distinct choices

Published online by Cambridge University Press:  27 October 2004

SERGIO ANTOY  and
MICHAEL HANUS
SERGIO ANTOY
Affiliation:
Computer Science Department, Portland State University, P.O. Box 751, Portland, OR 97207, USA (email: antoy@cs.pdx.edu)
MICHAEL HANUS
Affiliation:
Institut für Informatik, Christian-Albrechts-Universität Kiel, Olshausenstr. 40, D-24098 Kiel, Germany (email: mh@informatik.uni-kiel.de)
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.

An injective finite mapping is an abstraction common to many programs. We describe the design of an injective finite mapping and its implementation in Curry, a functional logic language. Curry supports the concurrent asynchronous execution of distinct portions of a program. This condition prevents passing from one portion to another a structure containing a partially constructed mapping to ensure that a new choice does not violate the injectivity condition. We present some motivating problems and we show fragments of programs that solve these problems using our design and implementation.

Information

Type
Functional pearls
Information
Journal of Functional Programming , Volume 14 , Issue 6 , November 2004 , pp. 657 - 668
Copyright
© 2004 Cambridge University Press

Footnotes

This research has been partially supported by the DAAD/NSF grant INT-9981317, the German Research Council (DFG) grant Ha 2457/1-2 and the NSF grants CCR-0110496 and CCR-0218224.
Submit a response

Discussions

No Discussions have been published for this article.