Abstract
We show how Wadler and Hughes’s use of Scott projections to describe properties of functions (“Projections for Strictness Analysis”, FPCA 1987) can be generalised by the use of partial equivalence relations. We describe an analysis (in the form of an abstract interpretation) for identifying such properties for functions defined in the simply typed λ-calculus. Our analysis has a very simple proof of correctness, based on the use of logical relations. We go on to consider how to derive ‘best’ correct interpretations for constants.
The full version of this paper is available as Departmental Report DOC 90/14, Dept. of Computing, Imperial College.
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.
Similar content being viewed by others
References
S. Abramsky. Abstract interpretation, logical relations and Kan extensions. Journal of Logic and Computation, 1 (1): 5–39, 1990.
M. Abadi and G. Plotkin. A per model of polymorphism and recursive types. In Logic in Computer Science. IEEE, 1990.
Asp90] A. G. Asperti. Categorical Topics in Computer Science. PhD thesis, Università di Pisa, 199Œ.
G.L. Burn, C.L. Hankin, and S. Abramsky. Strictness analysis of higher-order functions. Science of Computer Programming, 7: 249–278, November 1986.
G.L. Burn. Abstract Interpretation and the Parallel Evaluation of Functional Languages. PhD thesis, Department of Computing, Imperial College of Science and Technology, University of London, 1987.
R. J. M. Hughes. Backwards analysis of functional programs. DoC Research Report CSC/87/R3, University of Glasgow, March 1987.
Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, Berlin, 1971.
A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh., 1981.
Philip Wadler and R.J.M. Hughes. Projections for strictness analysis. In LNCS 27g. Functional Programming Languages and Computer Architectures, Oregon, USA, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hunt, S. (1991). PERs Generalise Projections for Strictness Analysis (Extended Abstract). In: Jones, S.L.P., Hutton, G., Holst, C.K. (eds) Functional Programming, Glasgow 1990. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3810-5_10
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3810-5_10
Publisher Name: Springer, London
Print ISBN: 978-3-540-19667-9
Online ISBN: 978-1-4471-3810-5
eBook Packages: Springer Book Archive