Work supported by ESPRIT BRA 3124 — Semantique
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S.Abramsky and C.L.Hankin eds., Abstract Interpretation of Declarative Languages. Ellis Horwood, Chichcster, England, 1987.
G.L.Burn, C.L.Hankin and S.Abramsky, Strictness analysis for higher order functions, In Science of Computer Programming, 7, 249–278, 1986.
G.L.Burn, A relationship between abstract interpretation and projection analysis, POPL, 1990.
P.Cousot and R.Cousot, Abstract Interpretation: A unified lattice model for static analyses of programs by construction of approximation fixpoints, POPL, 1977.
P.Dybjer, Inverse Image Analysis Generalises Strictness Analysis, Information and Computation 90, 2, 1991, pp 194–216.
C.V.Hall, Strictness Analysis Applied to Programs with Lazy List Constructors, Ph.D. thesis, Indiana University, 1987.
R.J.M.Hughes and J.Launchbury, Towards Relating Forwards and Backwards Analyses, Glasgow Functional Programming, Ullapool, In Workshops in Computing, S-V, 1991.
R.J.M.Hughes and J.Launchbury, Locally Relational Abstract Interpretation, in preparation, Glasgow University, 1991.
R.J.M.Hughes, Backwards Analysis of Functional Programs, In D.Bjørner, A.Ershov and N.D.Jones eds. Partial Evaluation and Mixed Computation, Proc. IFIP TC2 Workshop, Denmark, Oct 1987; North-Holland, 1988.
S.Hunt, PERs generalise projections for strictness analysis, Glasgow Functional Programming, Ullapool, In Workshops in Computing, S-V, 1991.
S.Hunt, Forwards and Backwards Strictness Analysis: Continuing the Comparison, unpublished draft, Imperial College, 1991.
T.Johnsson, Detecting when Call-by-Value can be used instead of Call-by-Need, Programming Methodology Group, PMG-14, Chalmers, Gothenburg, 1981.
J.Launchbury. Projection Factorisations in Partial Evaluation. Ph.D. Thesis, Glasgow University, 1989; Distinguished Dissertations in Computer Science, Vol 1, C.U.P. 1991.
J.Launchbury. Strictness and Binding-Time Analyses: Two for the Price of One, SIGPLAN PLDI, Toronto, 1991.
A.Mycroft, Abstract interpretation and optimising transformations for applicative languages, Ph.D. thesis, University of Edinburgh, 1981.
H.R.Nielson and F.Nielson, Bounded Fixed Point Iteration, POPL 92.
P.Wadler and R.J.M.Hughes, Projections for Strictness Anahjsis, FPCA 87.
P.Wadler, Strictness analysis on non-flat domains, In [AH87], 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hughes, J., Launchbury, J. (1992). Reversing abstract interpretations. In: Krieg-Brückner, B. (eds) ESOP '92. ESOP 1992. Lecture Notes in Computer Science, vol 582. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55253-7_16
Download citation
DOI: https://doi.org/10.1007/3-540-55253-7_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55253-6
Online ISBN: 978-3-540-46803-5
eBook Packages: Springer Book Archive