Assertions test expected properties of run-time values without disrupting the normal working of a program. So in a lazy functional language assertions should be lazy - not forcing evaluation, but only examining what is evaluated by other parts of the program. We explore the subtle semantics of lazy assertions and describe sequential and concurrent variants of a method for checking lazy assertions. All variants are implemented in Haskell
Six implementations of different lazy functional languages are compared using a common benchmark of ...
Lazy evaluation is an evaluation strategy in programming languages. Lazy evaluation delays the evalu...
We investigate the interaction of lazy evaluation and backtracking in the framework of functional lo...
Assertions test expected properties of run-time values without disrupting the normal computation of ...
Assertions test expected properties of run-time values without disrupting the normal computation of ...
Assertions test expected properties of run-time values without disrupting the normal computation of ...
Lazy functional programming languages need lazy assertions to ensure that assertions preserve the me...
AbstractLaziness restricts the exploitation of parallelism because expressions are evaluated only on...
In this paper we argue for the importance of lazy state, that is, sequences of imperative (destructi...
The evaluation strategies of programming languages can be broadly categorised as strict or lazy. A c...
Many state-of-the-art information-flow control (IFC) tools are implemented as Haskell libraries. In ...
We address the problem of producing a trace of the evaluation of a program written in a lazy functio...
This article describes the implementation of a debugger for lazy functional languages like Haskell. ...
: is a system for parallel evaluation of lazy functional programs implemented on a Sequent Symmetry....
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
Six implementations of different lazy functional languages are compared using a common benchmark of ...
Lazy evaluation is an evaluation strategy in programming languages. Lazy evaluation delays the evalu...
We investigate the interaction of lazy evaluation and backtracking in the framework of functional lo...
Assertions test expected properties of run-time values without disrupting the normal computation of ...
Assertions test expected properties of run-time values without disrupting the normal computation of ...
Assertions test expected properties of run-time values without disrupting the normal computation of ...
Lazy functional programming languages need lazy assertions to ensure that assertions preserve the me...
AbstractLaziness restricts the exploitation of parallelism because expressions are evaluated only on...
In this paper we argue for the importance of lazy state, that is, sequences of imperative (destructi...
The evaluation strategies of programming languages can be broadly categorised as strict or lazy. A c...
Many state-of-the-art information-flow control (IFC) tools are implemented as Haskell libraries. In ...
We address the problem of producing a trace of the evaluation of a program written in a lazy functio...
This article describes the implementation of a debugger for lazy functional languages like Haskell. ...
: is a system for parallel evaluation of lazy functional programs implemented on a Sequent Symmetry....
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
Six implementations of different lazy functional languages are compared using a common benchmark of ...
Lazy evaluation is an evaluation strategy in programming languages. Lazy evaluation delays the evalu...
We investigate the interaction of lazy evaluation and backtracking in the framework of functional lo...