Skip to main content

Analysing Functions by Projection-Based Backward Abstraction

  • Conference paper
Book cover Functional Programming, Glasgow 1992

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

  • 89 Accesses

Abstract

Various techniques for strictness analysis by non-standard interpretation have been proposed in which the basic non-standard values are projections. We show that continuous functions can be completely characterised by appropriate forward and backward abstractions.

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. Wray, S. “A new strictness detection algorithm.” In Proceedings of the Workshop in Implementation of Functional Languages (Aspenäs, Sweden). L. Augustsson et. al., eds. Report 17, Programming Methodology Group, Department of Computer Sciences, Chalmers University of Technology and University of Göteborg, Göteborg, Sweden.

    Google Scholar 

  2. Augustsson, L. and.Johnson, T. “The Chalmers Lazy ML Compiler.” Department of Computer Science, Chalmers University of Technology, Göteborg, Sweden, 1988.

    Google Scholar 

  3. Burn, G.L., “Using Projection Analysis in Compiling Lazy Functional Programs”, Proceedings of the 1990 ACM Conference on Lisp and Functioz al Programming,ACM, 1990.

    Google Scholar 

  4. Wadler, P., and Hughes, J. “Projections for Strictness Analysis.” In Proceedings of Functional Programming Languages and Computer Architecture (Portland, Oregon). G. Kahn, ed. LNCS 274. Springer-Verlag, Berlin, 1987.

    Google Scholar 

  5. Hunt, S. Projection analysis and stable functions. Unfinished manuscript.

    Google Scholar 

  6. Davis, K. “A Note on the Choice of Domains for Projection-Based Program Analysis.” In Functional Programming: Proceedings of the 1991 Glasgow Workshop, 13–15 August 1991, Isle of Skye, . P. Wadler et al., eds. Springer Workshops in Computing. Springer-Verlag, 1992.

    Google Scholar 

  7. Launchbury, J. Projection Factorisations in Partial Evaluation. PhD Thesis, Glasgow University, Nov 89. Distinguished Dissertation in Computer Science, Vol 1, CUP, 1991.

    Google Scholar 

  8. Berry, G. “Stable models of typed lambda-calculi.” In Proceedings of the 5th ICALP pp 375–387, LNCS 62. Springer-Verlag, Berlin, 1978.

    Google Scholar 

  9. Hughes, R.J.M. and Launchbury, J. “Relational Reversal of Abstract Interpretation.” In ??.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Davis, K. (1993). Analysing Functions by Projection-Based Backward Abstraction. In: Launchbury, J., Sansom, P. (eds) Functional Programming, Glasgow 1992. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3215-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3215-8_4

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19820-8

  • Online ISBN: 978-1-4471-3215-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics