Skip to main content Accessibility help
×
×
Home

Untyped strictness analysis

  • Christine Ernoult (a1) and Alan Mycroft (a2)
Abstract

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.

Copyright
References
Hide All
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.
Ernoult, C. and Mycroft, A. (1991) Uniform ideals and strictness analysis. Proc. 18th ICALP, Springer-Verlag Lecture Notes in Computer Science510.
Hudak, P. and Young, J. (1986) Higher order strictness analysis in untyped lambda calculus. Proc. 13th ACM Symp. on Principles of Programming Languages.
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.
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).
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.
Milner, R. (1978) A theory of type polymorphism in programming. JCSS.
Mycroft, A. (1981) Abstract interpretation and optimising transformations of applicative programs. PhD thesis, Edinburgh University. (Available as computer science report CST-15-81.)
Mycroft, A. and Jones, N. D. (1985) A relational framework for abstract interpretation. Proc. Programs as Data Objects Workshop. Springer-Verlag.
Mycroft, A. (1993) Completeness and predicate-based abstract interpretation. Proc. ACM Conf. on Partial Evaluation and Program Manipulation.
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.)
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Untyped strictness analysis

  • Christine Ernoult (a1) and Alan Mycroft (a2)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *