Lazy evaluation is an evaluation strategy in programming languages. Lazy evaluation delays the evaluation of an expression until its value is needed. With lazy evaluation, there are some advantages. One of the advantages enables to avoid unnecessary evaluations. Another advantage enables to help programmers write clear programs. In case of linked list, programmers can divide functions into two kinds, generation of list and consume of list. In this paper, we introduce an overview of lazy evaluation and our continuous research for lazy functional programming languages
Partial evaluation is a method for program specialization based on fold/unfold transformations [8, 2...
ing out and studying those patterns of computation as useful objects in their own right leads to fur...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
We address the problem of producing a trace of the evaluation of a program written in a lazy functio...
D We develop a natural technique for defining functions in logic, i.e. PROLOG, which directly yields...
In the recent years a multitude of functional language implementations has been developed, whereby t...
We investigate the interaction of lazy evaluation and backtracking in the framework of functional lo...
Functional languages can be enriched with logic variables to provide new computational features suc...
The goal of this thesis is to create a suitable standard for evaluating lazy evaluation techniques, ...
This thesis presents research into tracing the evaluation of lazy functional languages. The work is ...
Five implementations of different lazy functional languages are compared using a common benchmark of...
: is a system for parallel evaluation of lazy functional programs implemented on a Sequent Symmetry....
In this paper we present a new programming technique for lazy functional programming languages. The ...
AbstractIn this paper we present a new programming technique for lazy functional programming languag...
Partial evaluation is a method for program specialization based on fold/unfold transformations [8, 2...
ing out and studying those patterns of computation as useful objects in their own right leads to fur...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
We address the problem of producing a trace of the evaluation of a program written in a lazy functio...
D We develop a natural technique for defining functions in logic, i.e. PROLOG, which directly yields...
In the recent years a multitude of functional language implementations has been developed, whereby t...
We investigate the interaction of lazy evaluation and backtracking in the framework of functional lo...
Functional languages can be enriched with logic variables to provide new computational features suc...
The goal of this thesis is to create a suitable standard for evaluating lazy evaluation techniques, ...
This thesis presents research into tracing the evaluation of lazy functional languages. The work is ...
Five implementations of different lazy functional languages are compared using a common benchmark of...
: is a system for parallel evaluation of lazy functional programs implemented on a Sequent Symmetry....
In this paper we present a new programming technique for lazy functional programming languages. The ...
AbstractIn this paper we present a new programming technique for lazy functional programming languag...
Partial evaluation is a method for program specialization based on fold/unfold transformations [8, 2...
ing out and studying those patterns of computation as useful objects in their own right leads to fur...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...