Concurrent distinct choices

Authors:
Sergio Antoy;Michael Hanus
Affiliations:
Computer Science Department, Portland State University, P.O. Box 751, Portland, OR 97207, USA (email: antoy@cs.pdx.edu);Institut für Informatik, Christian-Albrechts-Universität Kiel, Olshausenstr. 40, D-24098 Kiel, Germany (email: mh@informatik.uni-kiel.de)
Venue:
Journal of Functional Programming
Year:
2004

Citing 4
Cited 1

Concurrent constraint programming

Concurrent constraint programming
A unified computation model for functional and logic programming

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A needed narrowing strategy

Journal of the ACM (JACM)
Optimal Non-deterministic Functional Logic Computations

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming

Multi-paradigm declarative languages

ICLP'07 Proceedings of the 23rd international conference on Logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.