Abstract
Various nonstandard interpretations of functional programs have been proposed in which the basic nonstandard values are projections. We show that every stable function is completely determined by an appropriate abstract value in the backward analysis, and that every continuous function is completely determined by an appropriate value in the forward analysis.
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
Wray, S. “A new strictness detection algorithm.” In Proceedings of the Workshop in Implementation of Functional Languages (Aspenäs, Sweden). L. Augustsson et. al., eds. Report 17, Programming Methodology Group, Department of Computer Sciences, Chalmers University of Technology and University of Göteborg, Göteborg, Sweden.
Augustsson, L. and Johnson, T. “The Chalmers Lazy ML Compiler.” Department of Computer Science, Chalmers University of Technology, Göteborg, Sweden, 1988.
Abramsky, S. and Hankin, C. “An introduction to abstract interpretation.” Ch. 1 of Abstract Interpretation of Declarative Languages. Abramsky, S. and Hankin, C. (eds. ). Ellis-Horwood, 1987.
Burn, G.L. “Using projection analysis in compiling lazy functional programs.” In Proceedings of the ACM Conference on Lisp and Functional Programming (Nice, June 1990 ).
Wadler, P., and Hughes, J. Projections for Strictness Analysis. Report 35, Programming Methodology Group, Department of Computer Sciences, Chalmers University of Technology and University of Göteborg, Göteborg, Sweden, 1987.
Davis, K. and Wadler, P. “Strictness analysis: Proved and improved.” In Functional Programming, Glasgow 1989: Proceedings of the 1989 Glasgow Workshop on Functional Programming, 21–23 August 1989, Fraserburgh, Scotland. K. Davis and J. Hughes, eds. Springer Workshops in Computing. Springer-Verlag, 1990.
Hughes, R.J.M. and Launchbury, J. Projections for polymorphic strictness analysis. CS Report Series CSC 90/R33, Department of Computing Science, University of Glasgow, 1990.
Davis, K. and Wadler, P. “Strictness analysis in 4D.” In Functional Programming, Glasgow 1990: Proceedings of the 1990 Glasgow Workshop on Functional Programming, 13–15 August 1990, Ullapool, Scotland. Simon L. Peyton Jones et al., eds. Springer Workshops in Computing. Springer-Verlag, 1991.
Launchbury, J. Projection Factorisation in Partial Evaluation. Ph.D. thesis, Department of Computing Science, University of Glasgow, 1990.
Hunt, S. Projection analysis and stable functions. Unfinished manuscript.
Berry, G. “Stable models of typed lambda-calculi.” In Proceedings of the 5th ICALP pp 375–387, LNCS 62. Springer-Verlag, Berlin, 1978.
Hughes, R.J.M. and Launchbury, J. “Towards relating forwards and backwards analysis.” In Functional Programming, Glasgow 1990: Proceedings of the 1990 Glasgow Workshop on Functional Programming, 13–15 August 1990, Ullapool, Scotland. Simon L. Peyton Jones et al., eds. Springer Workshops in Computing. Springer-Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 British Computer Society
About this paper
Cite this paper
Davis, K. (1992). A Note on the Choice of Domains for Projection-Based Program Analysis. In: Heldal, R., Holst, C.K., Wadler, P. (eds) Functional Programming, Glasgow 1991. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3196-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3196-0_6
Publisher Name: Springer, London
Print ISBN: 978-3-540-19760-7
Online ISBN: 978-1-4471-3196-0
eBook Packages: Springer Book Archive