Skip to main content
SpringerLink
Log in

Uniform ideals and strictness analysis

  • Functional Programming (Session 2)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 510))

Included in the following conference series:

Abstract

We propose a notion of uniform ideal (certain Scott-closed sets) to characterise strictness properties. This enables us to explain why Hughes' and Wadler's H projection for lazy list strictness analysis is not in general expressible as an abstract interpretation property of the standard semantics. We give circumstances when it is so expressible. Doing so casts light on Burn's H B projection and his question of its relationship to H.

Uniform ideals are a generalisation of the sets of values corresponding to types in (simple) polymorphic type systems. Wadler's doubly-lifted abstract domain constructor for lazy lists can be seen as a special case which only uses certain uniform ideals.

The confluence of strictness and type theory furthers Kuo and Mishra's notion of “strictness types”.

This author's contribution was supported by an INRIA fellowship and subsequent funding.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S. Strictness analysis and polymorphic invariance. In [8].

    Google Scholar 

  2. Burn, G. A relationship between abstract interpretation and projection analysis (extended abstract). Proc. 17th ACM symp. on Principles of Programming Languages, 1990.

    Google Scholar 

  3. Burn, G. Lazy functional languages: interpretation and compilation. Unpublished manuscript, forthcoming book, 1990.

    Google Scholar 

  4. Burn, G., Hankin, C. and Abramsky, S. The theory and practice of strictness analysis for higher order functions. In [8].

    Google Scholar 

  5. Ernoult, C. Higher-order strictness analysis over non-flat domains. INRIA (Rocquencourt) rapport 1190, 1990.

    Google Scholar 

  6. Hudak, P. and Young, J. Higher order strictness analysis in untyped lambda calculus. Proc. 13th ACM symp. on Principles of Programming Languages, 1986.

    Google Scholar 

  7. Hunt, L.S. PERs generalise projections for strictness analysis. Departmental report DOC 90/14, Dept. of Computing, Imperial College, London.

    Google Scholar 

  8. Jones, N.D. and Ganzinger, H. (eds.) Programs as Data Objects. Lecture Notes in Computer Science: Proc. of a Workshop, Copenhagen, vol. 215, Springer-Verlag, 1985.

    Google Scholar 

  9. Kuo, T.-M. and Mishra, P. Strictness analysis: a new perspective based on type inference. ACM-IFIP, Proc. of the functional programming and computer architecture conference, 1989.

    Google Scholar 

  10. MacQueen, D., Plotkin, G.D. and Sethi, R. An ideal model for recursive polymorphic types. Proc. 11th ACM symp. on Principles of Programming Languages, 1984.

    Google Scholar 

  11. Mycroft, A. Abstract interpretation and optimising transformations of applicative programs. Ph.D. thesis, Edinburgh University, 1981. Available as computer science report CST-15-81.

    Google Scholar 

  12. Nielson, F. Abstract interpretation using domain theory. Ph.D. thesis, Edinburgh University, 1984. Available as computer science report CST-31-84.

    Google Scholar 

  13. Vickers, S. Topology via logic. Cambridge Tracts in Theoretical Computer Science 5. Cambridge University Press 1989.

    Google Scholar 

  14. Wadler, P.L. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In Abramsky, S. and Hankin, C. (eds.) Abstract interpretation of declarative languages. Ellis Horwood, Chichester, UK, 1987.

    Google Scholar 

  15. Wadler, P.L. and Hughes R.J.M. Projections for strictness analysis. In G. Kahn (ed.) Lecture Notes in Computer Science: Proc. of the functional programming and computer architecture conference, vol. 274, Springer-Verlag, 1987.

    Google Scholar 

  16. Wright, D.A. Strictness analysis via (type) inference. Report R89-3, Electrical Engineering and Computer Science Dept., Tasmania University, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Alcatel Alsthom Recherche, Route de Nozay, 91460, Marcoussis, France

    Christine Ernoult

  2. Computer Laboratory, Cambridge University, New Museums Site, Pembroke Street, CB2 3QG, Cambridge, United Kingdom

    Alan Mycroft

Authors
  1. Christine Ernoult
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Mycroft
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ernoult, C., Mycroft, A. (1991). Uniform ideals and strictness analysis. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_124

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_124

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation