Advertisement

Strictness detection in non-flat domains

  • John Hughes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 217)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. L. Burn, C. Hankin, S. Abramsky, The Theory and Practice of Strictness Analysis for Higher-Order Functions, General Electric Company/Imperial College London 1985.Google Scholar
  2. 2.
    C. D. Clack, S. L. Peyton-Jones, Generating Parallelism from Strictness Analysis, Internal note 1679, University College London, February 1985.Google Scholar
  3. 3.
    J. Fairbairn, Removing Redundant Laziness from Super-combinators, in Proceedings of the Workshop on Implementations of Functional Languages, Aspenæs, Gøteborg, February 1985.Google Scholar
  4. 4.
    P. Hudak, J. Young, A Set-Theoretic Characterisation of Function Strictness in the Lambda Calculus, in Proceedings of the Workshop on Implementations of Functional Languages, Aspenæs, Gøteborg, February 1985.Google Scholar
  5. 5.
    A. Mycroft, The Theory and Practice of Transforming Call-by-Need into Call-by-Value, pp 269–281 in Proceedings 4th International Symposium on Programming, Lecture Notes in Computer Science, Vol. 83, Springer-Verlag, Paris, April 1980.Google Scholar
  6. 6.
    S. C. Wray, A New Strictness Detection Algorithm, in Proceedings of the Workshop on Implementations of Functional Languages, Aspenæs, Gøteborg, February 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • John Hughes
    • 1
  1. 1.Institutionen før InformationsbehandlingChalmers Tekniska HøgskolaGøteborgSweden

Personalised recommendations