Skip to main content

Implementing Projection-based Strictness Analysis

  • Conference paper
Functional Programming, Glasgow 1991

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

Abstract

Projection-based backwards strictness analysis has been understood for some years. Surprisingly, even though the method is fairly simple and quite general, no reports of its implementation have appeared. This paper describes ideas underlying our prototype implementation of the analysis for a simple programming language. The implementation serves as a case study before applying the method in the Glasgow Haskell compiler.

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.

Bibliography

  1. L. Augustsson. A Compiler for Lazy ML. Proceedings of Lisp and Functional Programming Conference, Austin, Texas, 1984.

    Google Scholar 

  2. K. Davis and P. Wadler, Strictness Analysis in 4D, Third Annual Glasgow Workshop on Functional Programming, Ullapool, Workshops in Computing, S- V, 1990.

    Google Scholar 

  3. R.J.M. Hughes and J. Launchbury, Projections for Polymorphic Strictness Analysis, To appear in Mathematical Structures in Computer Science, C.U.P.

    Google Scholar 

  4. R.J.M. Hughes, Projections for Polymorphic Strictness Analysis, In Category Theory in Computer Science, Manchester, 1989.

    Google Scholar 

  5. N.D. Jones and A. Mycroft, Data Flow Analysis of Applicative Programs Using Minimal Function Graphs, Proc. of the Thirteenth ACM Symposium on Principles of Programmng Languages, St. Petersburg, Florida, pp. 296–306, 1986

    Google Scholar 

  6. J. Launchbury, Projections for Specialisation, in Bjørner, Ershov and Jones (eds), Partial Evaluation and Mixed Computation. Proceedings IFIP TC2 Workshop, Denmark, Oct 1987. North-Holland, 1988.

    Google Scholar 

  7. J. Launchbury, Projection Factorisations in Partial Evaluation, Ph.D. thesis, Glasgow University. Distinguished Dissertations in Computer Science, Vol 1, CUP, 1991.

    Google Scholar 

  8. P. Wadler and R.J.M. Hughes, Projections for Strictness Analysis, In Functional Programming and Computer Architecture, Portland, USA, LNCS 274, 1987

    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

Kubiak, R., Hughes, J., Launchbury, J. (1992). Implementing Projection-based Strictness Analysis. 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_17

Download citation

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

  • 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