Abstract Interpretation of Higher Order Functions using Concrete Data Structures (Summary)
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.
Unable to display preview. Download preview PDF.
- 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
- G. L. Burn, C. L. Hankin and S. Abramsky. Strictness Analysis for Higher-Order Functions. Science of Computer Programming, 7, 1986.Google Scholar
- 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
- Sebastian Hunt, Frontiers And Open Sets in Abstract Interpretation.Google Scholar
- Sebastian Hunt, personal communication.Google Scholar
- Julian Seward, presentation, Strictness Day, May 1992, Strathaven.Google Scholar
- 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
- Phil Wadler, Strictness Analysis on Non-Flat Domains (by Abstract Interpretation over Finite Domains).Google Scholar