Abstract
Despite intense theoretical work on broad range of advanced abstract interpretation techniques, such technology has not seen wide integration into functional language compilers. One stumbling block often turns out to be how to solve the recursive domain equations produced by abstract interpretation.
In this paper, we return to an old idea: using a term rewriter to solve such equations. By careful design of the terms and their reduction system, various nice properties are obtained: cheap polymorphic analysis, and a way to avoid excessive work. A prototype projection analyser has been completed, and shows promising performance on realistic Haskell programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lennart Augustsson. Implementing haskell overloading. In Proceedings of the Functional Programming Languages and Computer Architecture Conference, Copenhagen, Denmark, June 1993.
G.L. Burn. Abstract Interpretation and the Parallel Evaluation of Functional Languages. PhD thesis, Imperial College, University of London, March 1987.
Charles Consel. Fast strictness analysis via symbolic fixpoint iteration. Unpublished. Yale University, Department of Computer Science, September 1991.
P.-L. Curien. Categorical Combinators, Sequential Algorithms And Functional Programming. Research Notes in Theoretical Computer Science series. Pitman Publishing Limited, London, 1986.
Alex Ferguson and John Hughes. Abstract interpretation of higher-order functions using concrete data structures. 1993.
Sebastian Hunt and Chris Hankin. Fixed points and frontiers: a new perspective. Journal of Functional Programming, 1(1):91–120, January 1991.
Sebastian Hunt and Chris Hankin. Approximate fixed points in abstract interpretation. In Fourth European Symposium on Programming, Rennes, France, 1992. LNCS 582.
Pieter H. Hartel and Koen G. Langendoen. Benchmarking implementations of lazy functional languages. Technical report, Department of Computer Systems, Faculty of Mathematics and Computer Science, University of Amsterdam, December 1992.
John Hughes. Backwards analysis of functional programs. Technical Report CSC/87/R3, University of Glasgow, Department of Computing Science, March 1987.
John Hughes. Private communication regarding cdss, 1993.
Neil D. Jones and Alan Mycroft. Data flow analysis of applicative programs using minimal function graphs: Abridged version. In Unknown, but definitely in an ACM proceedings, 1986.
T. Johnsson. Attribute grammars as a functional programming paradigm. In G. Kahn, editor, Proceedings of the Functional Programming Languages and Computer Architecture Conference, pages 154–173. Springer-Verlag LNCS 274, September 1987.
R. Kubiak, J. Hughes, and J. Launchbury. A prototype implementation of projection-based first-order polymorphic strictness analysis. In R. Heldal, editor, Draft Proceedings of Fourth Annual Glasgow Workshop on Functional Programming, pages 322–343, Skye, August 13-15 1991.
George C. Nelan. Firstification. Date unknown, but must be 1992 or after. Based on Nelan’s PhD thesis. Arizona State University, 1992.
Eric Nocker. Strictness analysis using abstract reduction. In Proceedings of FPCA93, Copenhagen, Denmark, June 1993.
Simon Peyton Jones and Chris Clack. Finding fixpoints in abstract interpretation. In S. Abramsky and C.L. Hankin, editors, Abstract Interpretation of Declarative Languages, Computers and Their Applications, chapter 11, pages 246–265. Ellis Horwood, 1987.
Julian Seward. Towards a strictness analyser for haskell: Putting theory into practice. Master’s thesis, University of Manchester, Department of Computer Science, 1991. Available as University of Manchester Technical Report UMCS-92-2-2.
Julian Seward. Polymorphic, higher order strictness analysis using frontiers. Unpublished paper, 1992.
Julian Seward. Polymorphic strictness analysis using frontiers. In Proceedings of the Symposium on Partial Evaluation and Semantics based Program Manipulation, PEPM93, Copenhagen, Denmark, June 1993.
Julian Seward. Strictness analysis à grande vitesse: Rewriting the rules of the evaluation transformers game. Unpublished manuscript, June 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 British Computer Society
About this chapter
Cite this chapter
Seward, J. (1994). Solving recursive domain equations by term rewriting. In: O’Donnell, J.T., Hammond, K. (eds) Functional Programming, Glasgow 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3236-3_21
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3236-3_21
Publisher Name: Springer, London
Print ISBN: 978-3-540-19879-6
Online ISBN: 978-1-4471-3236-3
eBook Packages: Springer Book Archive