Strictness detection in non-flat domains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 217 LNCS, Issue , 1986, Pages 112-135

  Hughes, John ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85029531988     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-16446-4_7     Document Type: Conference Paper

References (6)

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.
2. C. D. Clack, S. L. Peyton-Jones, Generating Parallelism from Strictness Analysis, Internal note 1679, University College London, February 1985.
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.
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.
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.
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.