Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Towards Relating Forwards and Backwards Analyses

  • Conference paper
Functional Programming, Glasgow 1990

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

  • 63 Accesses

Abstract

In this paper we take steps towards a unified framework in which both forwards and backwards analyses may be discussed. We present natural deduction style rules, instances of which may be used to define analyses in either direction. Some insights resulting from the approach are drawn out, together with a conjecture that non-relational forwards analysis is unable to discover head-strictness.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. S. Abramsky and C. Hankin (editors). Abstract Interpretation of Declarative Languages. Ellis Horwood, Chichester, England, 1987.

    Google Scholar 

  2. D. Bjorner, A. Ershov and N. Jones (Editors). Partial Evaluation and Mixed Computation. Proceedings IFIP TC2 Workshop, Gammel Avernws, Denmark, October 1987. North-Holland, 1988.

    Google Scholar 

  3. G. Burn. A Relationship Between Abstract Interpretation and Projection Analysis. POPL 90, San Francisco, 1990.

    Google Scholar 

  4. R.J.M. Hughes. Backwards Analysis of Functional Programs. In [BEJ88], pages 187–208, 1988.

    Google Scholar 

  5. R.J.M. Hughes. Projections for Polymorphic Strictness Analysis. In Proc of Symposium on Category Theory and Computer Science, Manchester 1989.

    Google Scholar 

  6. Hun90] S. Hunt. PERs Generalise Projections for Strictness Analysis This volume.

    Google Scholar 

  7. J. Launchbury. Projection Factorisations in Partial Evaluation. Ph.D. Thesis, Glasgow University, 1989.

    Google Scholar 

  8. P. Wadler and R.J.M. Hughes. Projections for Strictness Analysis. FPCA 87, Portland, Oregan, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Glasgow University, UK

    John Hughes & John Launchbury

Authors
  1. John Hughes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Launchbury
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Simon L. Peyton Jones Graham Hutton Carsten Kehler Holst

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hughes, J., Launchbury, J. (1991). Towards Relating Forwards and Backwards Analyses. In: Jones, S.L.P., Hutton, G., Holst, C.K. (eds) Functional Programming, Glasgow 1990. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3810-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3810-5_9

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19667-9

  • Online ISBN: 978-1-4471-3810-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation