Reasoning about explicit strictness in a lazy language using mixed lazy/strict semantics

@inproceedings{Eekelen2002ReasoningAE,
  title={Reasoning about explicit strictness in a lazy language using mixed lazy/strict semantics},
  author={Marko C. J. D. van Eekelen and Maarten de Mol},
  year={2002}
}
Many functional programmers are familiar with the concept of enforcing strictness for making applications fit their time and space efficiency requirements. Few functional programmers however, are familiar with the consequences of enforcing strictness for formal reasoning about their programs. This paper attempts to fill the gap between the few and the many. Some typical examples are given of the use and the meaning of explicit strictness. We show how formal reasoning can be made easier by the… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

pages 144–154

  • John Launchbury. A natural semantics for lazy evaluatio Languages
  • Charleston, South Carolina,
  • 1993
Highly Influential
16 Excerpts

The Isabelle Reference Manual

  • L. C. Paulson
  • University of Cambridge,
  • 2001
1 Excerpt

G

  • H.-J. Kreowski H. Ehrig
  • Engels and G. Rozenberg (eds.). Handbook of Graph…
  • 1999

In Proceedings of Applications of Graph Transformations with Industrial Relevance 1999

  • Maarten de Mol, Marko van Eekelen. A proof tool dedicated to clean - the prototype
  • volume 1779 of Lecture Notes in Computer Science…
  • 1999
1 Excerpt

Stringer-Calvert

  • S. Owre, N.Shankar, J. M. Rushby, D.W.J
  • PVS Language Reference (version 2.3),
  • 1999
1 Excerpt

chapter 2

  • Erik Barendsen, Sjaak Smeters. Graph Rewriting Aspects of Functional Programming
  • pages 63–102. In [HEe99],
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…