The article defines algebraic semantics of singular (call-time-choice) and plural (run-time-choice) nondeterministic parameter passing and presents a specification language in which operations with both kinds of parameters can be defined simultaneously. Sound and complete calculi for both semantics are introduced. We study the relations between the two semantics and point out that axioms for operations with plural arguments may be considered as axiom schemata for operations with singular arguments
AbstractAbstract relational algebra is proposed as a practical means to describe the denotational se...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
AbstractThe main concern of this paper is the interplay between functionality and nondeterminism. We...
Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, ...
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional progra...
Abstract. Formalisms involving some degree of nondeterminism are frequent in computer science. In pa...
Non-strict non-deterministic functions are one of the most dis-tinctive features of functional-logic...
AbstractRecently, a new semantics for non-deterministic lazy functional(-logic) programming has been...
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional progra...
AbstractCall by value and call by name have some subtleties when used in a nondeterministic programm...
AbstractThe priveleged field of classical algebra and term-rewriting systems is that of strictly det...
"Nondeterminism in Algebraic Specifications and Algebraic Programs" presents a mathematical theory f...
Recently, a new semantics for non-deterministic lazy functional(-logic) programming has been present...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
AbstractThis paper is concerned with the problems encountered in defining the semantics of nondeterm...
AbstractAbstract relational algebra is proposed as a practical means to describe the denotational se...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
AbstractThe main concern of this paper is the interplay between functionality and nondeterminism. We...
Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, ...
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional progra...
Abstract. Formalisms involving some degree of nondeterminism are frequent in computer science. In pa...
Non-strict non-deterministic functions are one of the most dis-tinctive features of functional-logic...
AbstractRecently, a new semantics for non-deterministic lazy functional(-logic) programming has been...
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional progra...
AbstractCall by value and call by name have some subtleties when used in a nondeterministic programm...
AbstractThe priveleged field of classical algebra and term-rewriting systems is that of strictly det...
"Nondeterminism in Algebraic Specifications and Algebraic Programs" presents a mathematical theory f...
Recently, a new semantics for non-deterministic lazy functional(-logic) programming has been present...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
AbstractThis paper is concerned with the problems encountered in defining the semantics of nondeterm...
AbstractAbstract relational algebra is proposed as a practical means to describe the denotational se...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
AbstractThe main concern of this paper is the interplay between functionality and nondeterminism. We...