Skip to main content
SpringerLink
Log in

Abstract Interpretation of Higher Order Functions using Concrete Data Structures (Summary)

  • Conference paper
Functional Programming, Glasgow 1992

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

Abstract

An implementation of abstract interpretation is outlined, which uses techniques taken from work on semantics of sequential languages. For a familiar example, analysis is much faster than with the frontiers method.

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

Access this chapter

Log in via an institution
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. G. Berry and P.-L. Curien, Theory and practice of sequential algorithms: the kernel of the applicative language CDS, Algebraic Methods in semantics, 35–87, Cambridge University Press (1985).

    Google Scholar 

  2. G. L. Burn, C. L. Hankin and S. Abramsky. Strictness Analysis for Higher-Order Functions. Science of Computer Programming, 7, 1986.

    Google Scholar 

  3. John Hughes and A. B. Ferguson, A Loop-detecting Interpreter for Lazy, Higher-order Programs, Functional Programming, Glasgow 1992, Springer-Verlag, Workshops in Computing (1992).

    Google Scholar 

  4. Sebastian Hunt, Frontiers And Open Sets in Abstract Interpretation.

    Google Scholar 

  5. Sebastian Hunt, personal communication.

    Google Scholar 

  6. Julian Seward, presentation, Strictness Day, May 1992, Strathaven.

    Google Scholar 

  7. J. H. Young, The Theory and Practice of Semantic Program Analysis for Higher-Order Functional Programming Languages. Yale University Research Report YALEU/DCS/RR-669.

    Google Scholar 

  8. Phil Wadler, Strictness Analysis on Non-Flat Domains (by Abstract Interpretation over Finite Domains).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Glasgow, Scotland

    A. B. Ferguson

  2. Chalmers University of Technology, Göteborg, Sweden

    John Hughes

Authors
  1. A. B. Ferguson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Hughes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, The University, G12 8QQ, Glasgow, Scotland

    John Launchbury MA (Oxon), MSc, PhD  & Patrick Sansom BSc (Hons)  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Ferguson, A.B., Hughes, J. (1993). Abstract Interpretation of Higher Order Functions using Concrete Data Structures (Summary). 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_5

Download citation

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

  • 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

Search

Navigation