Lazy call-by-value evaluation

  title={Lazy call-by-value evaluation},
  author={Bernd Brassel and Michael Hanus and Sebastian Fischer and Frank Huch and Germ{\'a}n Vidal},
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in which the information collected as a trace is reduced considerably (kilobytes instead of megabytes). The idea is to collect a kind of step information for a call-by-value interpreter, which can then efficiently reconstruct the computation for debugging/viewing tools, like declarative debugging. We show the correctness… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 10 references

Lazy Call-By-Value Evaluation

B. Braßel, S. Fischer, M. Hanus, F. Huch, G. Vidal
Technical report, CAU Kiel, • 2007
View 6 Excerpts
Highly Influenced

Debugging Haskell by Observing Intermediate Data Structures

Electr. Notes Theor. Comput. Sci. • 2000
View 3 Excerpts
Highly Influenced

A Natural Semantics for Lazy Evaluation

POPL • 1993
View 4 Excerpts
Highly Influenced

Declarative Debugging with Buddha

Advanced Functional Programming • 2004
View 4 Excerpts
Highly Influenced

The Evaluation Dependence Tree as a Basis for Lazy Functional Debugging

Automated Software Engineering • 1997
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…