This paper addresses the starting point of the refinement process: the naive program. Although a naive program provides a useful starting point for refinement and is complete with respect to all the possible outcomes it usually exhibits exponential computational complexity which prohibits using the initial naive system as a prototype
We investigate the extension of non-strict functional languages like Haskell or Clean by a non-deter...
Pure functional programming language offer many advantages over impure languages. Unfortunately, the...
AbstractWe study systems where deterministic computations take place in environments which may behav...
This paper addresses the starting point of the refinement process: the naive program. Although a nai...
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional progra...
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional progra...
Non-deterministic computations greatly enhance the expressive power of functional logic programs, bu...
AbstractWe define a rewrite strategy for a class of non-confluent constructor-based term graph rewri...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
. We show that non-determinism simplifies coding certain problems into programs. We define a non-con...
AbstractThe refinement calculus for logic programs consists of a wide-spectrum language and a notion...
Non-deterministic computations greatly enhance the expressive power of functional logic programs, bu...
AbstractNon-deterministic computations greatly enhance the expressive power of functional logic prog...
This thesis investigates nondeterminism in functional programming languages. To establish a precise ...
We investigate the extension of non-strict functional languages like Haskell or Clean by a non-deter...
Pure functional programming language offer many advantages over impure languages. Unfortunately, the...
AbstractWe study systems where deterministic computations take place in environments which may behav...
This paper addresses the starting point of the refinement process: the naive program. Although a nai...
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional progra...
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional progra...
Non-deterministic computations greatly enhance the expressive power of functional logic programs, bu...
AbstractWe define a rewrite strategy for a class of non-confluent constructor-based term graph rewri...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
The refinement calculus for logic programs consists of a wide-spectrum language and a notion of refi...
. We show that non-determinism simplifies coding certain problems into programs. We define a non-con...
AbstractThe refinement calculus for logic programs consists of a wide-spectrum language and a notion...
Non-deterministic computations greatly enhance the expressive power of functional logic programs, bu...
AbstractNon-deterministic computations greatly enhance the expressive power of functional logic prog...
This thesis investigates nondeterminism in functional programming languages. To establish a precise ...
We investigate the extension of non-strict functional languages like Haskell or Clean by a non-deter...
Pure functional programming language offer many advantages over impure languages. Unfortunately, the...
AbstractWe study systems where deterministic computations take place in environments which may behav...