Parameter passing in nondeterministic recursive programs

AbstractCall by value and call by name have some subtleties when used in a nondeterministic programming language. A common formalism is used to establish the denotational semantics of recursive programs called by name and called by value. Ashcroft and Hennessy introduced the idea of differentiating between selecting arguments from a set of arguments at the point of invocation and selecting arguments during the run of the procedure. This distinction is shown to be independent of the evaluation according to value or name, giving rise to four possible parameter passing methods, all of which have a suitable least fixed point semantics

Nondeterminism in algebraic specifications and algebraic programs

"Nondeterminism in Algebraic Specifications and Algebraic Programs" presents a mathematical theory for the integration of three concepts: non-determinism, axiomatic specification and term rewriting. For non-deterministic programs, an algebraic specification language is provided which admits the application of automated tools based on term rewriting techniques. This general framework is used to explore connections between logic programming and algebraic programming. Examples from various areas of computer science are given, including results of computer experiments with a prototypical implementation. This book should be of interest to readers working within several fields of theoretical computer science, from algebraic specification theory to formal descriptions of distributed systems