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

  • A. B. Ferguson
  • John Hughes
Conference paper
Part of the Workshops in Computing book series (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.

Keywords

Assure Hunt 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [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. [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. [4]
    Sebastian Hunt, Frontiers And Open Sets in Abstract Interpretation.Google Scholar
  5. [5]
    Sebastian Hunt, personal communication.Google Scholar
  6. [6]
    Julian Seward, presentation, Strictness Day, May 1992, Strathaven.Google Scholar
  7. [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. [8]
    Phil Wadler, Strictness Analysis on Non-Flat Domains (by Abstract Interpretation over Finite Domains).Google Scholar

Copyright information

© British Computer Society 1993

Authors and Affiliations

  • A. B. Ferguson
    • 1
  • John Hughes
    • 2
  1. 1.University of GlasgowScotland
  2. 2.Chalmers University of TechnologyGöteborgSweden

Personalised recommendations