Skip to main content

A Loop-Detecting Interpreter for Lazy Programs

  • Conference paper
Functional Programming, Glasgow 1991

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 67 Accesses

Abstract

This paper develops a loop detecting interpreter for a lazy language. The loop detection scheme is a further development of what takes place in memoising interpreters and in pending analysis. It is our hope that the work described in this paper, in the end, will help to improve both of these, and be a stepping stone towards a non-trivial partial evaluator for a lazy language.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carsten Kehler Holst. Finiteness analysis. In John Hughes, editor, Functional Programming Languages and Computer Architectures, volume 523 of Lecture Notes in Computer Science, pages 473–495, Cambridge, Massachusetts, USA, August 1991. ACM, Springer-Verlag.

    Google Scholar 

  2. Carsten Kehler Holst and Carsten Krogh Gomard. Partial evaluation is fuller laziness. In Paul Hudak and Neil D. Jones, editors, Partial Evaluation and Semantic Based Program Manipulation, volume 26,9 of SIGPLAN NOTICES, pages 223–233, New Haven, Connecticut, USA, June 1991. ACM, ACM Press.

    Google Scholar 

  3. John Hughes. Lazy memo-functions. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architectures, volume 201 of Lecture Notes in Computer Science, pages 129–146, Nancy, France, September 1985. Springer-Verlag.

    Google Scholar 

  4. Neil D. Jones, Peter Sestoft, and Harald Søndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2 (1): 9–50, 1989.

    Article  Google Scholar 

  5. Daniel Weise, Roland Conybeare, Erik Ruf, and Scott Seligman. Automatic online partial evaluation. In John Hughes, editor, Functional Programming Languages and Computer Architectures, volume 523 of Lecture Notes in Computer Science, pages 165–191, Cambridge, Massachusetts, USA, August 1991. ACM, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 British Computer Society

About this paper

Cite this paper

Holst, C.K., Hughes, J. (1992). A Loop-Detecting Interpreter for Lazy Programs. In: Heldal, R., Holst, C.K., Wadler, P. (eds) Functional Programming, Glasgow 1991. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3196-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3196-0_14

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19760-7

  • Online ISBN: 978-1-4471-3196-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics