Non-determinism in Functional Languages

Open Access
Publisher Website
Google Scholar
Abstract
The introduction of a non-deterministic operator in even a very simple functional programming language gives rise to a plethora of semantic questions. These questions are not only concerned with the choice operator itself. A surprisingly large number of different parameter passing mechanisms are made possible by the introduction of bounded non-determinism. The diversity of semantic possibilities is examined systematically using denotational definitions based on mathematical structures called power domains. This results in an improved understanding of the different kinds of non-determinism and the properties of different kinds of non-deterministic languages.

This publication has 0 references indexed in Scilit: