Hostname: page-component-848d4c4894-4rdrl Total loading time: 0 Render date: 2024-06-13T14:06:06.205Z Has data issue: false hasContentIssue false

Untyped strictness analysis

Published online by Cambridge University Press:  07 November 2008

Christine Ernoult
Affiliation:
Computer Laboratory, Cambridge University, New Museums Site, Pembroke Street, Cambridge CB2 3QG, UK (e-mail: ernoult@info.emn.fr)
Alan Mycroft
Affiliation:
Computer Laboratory, Cambridge University, New Museums Site, Pembroke Street, Cambridge CB2 3QG, UK (e-mail: Alan.Mycroft@cl.cam.ac.uk)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We re-express Hudak and Young's higher-order strictness analysis for the untyped λ-calculus in a conceptually simpler and more semantically-based manner. We show our analysis to be a sound abstraction of Hudak and Young's which is also complete in a sense we make precise.

Type
Articles
Copyright
Copyright © Cambridge University Press 1995

References

Burn, G., Hankin, C. and Abramsky, S. (1985) The theory and practice of strictness analysis for higher order functions. Proc. Programs as Data Objects Workshop. Springer-Verlag.Google Scholar
Ernoult, C. and Mycroft, A. (1991) Uniform ideals and strictness analysis. Proc. 18th ICALP, Springer-Verlag Lecture Notes in Computer Science510.CrossRefGoogle Scholar
Hudak, P. and Young, J. (1986) Higher order strictness analysis in untyped lambda calculus. Proc. 13th ACM Symp. on Principles of Programming Languages.CrossRefGoogle Scholar
Jones, N. D. and Ganzinger, H. (eds.) 1985 Programs as Data Objects: Proc. of a Workshop, Copenhagen, Denmark. Springer-VerlagLecture Notes in Computer Science 215.Google Scholar
Kuo, T.-M. and Mishra, P. (1989) Strictness analysis: a new perspective based on type inference. Proc. Functional Programming and Computer Architecture Conference (ACM-IFIP).CrossRefGoogle Scholar
MacQueen, D., Plotkin, G. D. and Sethi, R. (1984) An ideal model for recursive polymorphic types. Proc. 11th ACM Symp. on Principles of Programming Languages.CrossRefGoogle Scholar
Milner, R. (1978) A theory of type polymorphism in programming. JCSS.Google Scholar
Mycroft, A. (1981) Abstract interpretation and optimising transformations of applicative programs. PhD thesis, Edinburgh University. (Available as computer science report CST-15-81.)Google Scholar
Mycroft, A. and Jones, N. D. (1985) A relational framework for abstract interpretation. Proc. Programs as Data Objects Workshop. Springer-Verlag.Google Scholar
Mycroft, A. (1993) Completeness and predicate-based abstract interpretation. Proc. ACM Conf. on Partial Evaluation and Program Manipulation.Google Scholar
Young, J. (1989) The theory and the practice semantic program analysis for higher-order functional programming languages. PhD thesis, Department of Computer Science, Yale University. (Available as research report YALEDU/DCS/RR-669.)Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.