Abstract
Strictness analysis is viewed as a differencing operation over functions. This results in differencing equations that have a similar form to those found in the calculus of real valued functions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. F. Sellers, Jr., M. Y. Hsiao, and L. W. Bearnson. “Analyzing errors with the Boolean Difference”. IEEE Transactions on Computing. Vol. EC-17, July 1968, pp. 676–683.
Peyton-Jones S. L. The Implementation of Functional Programming Languages. Prentice-Hall, 1987, pp. 387–390.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Singh, S. (1991). Differentiating Strictness. In: Jones, S.L.P., Hutton, G., Holst, C.K. (eds) Functional Programming, Glasgow 1990. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3810-5_22
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3810-5_22
Publisher Name: Springer, London
Print ISBN: 978-3-540-19667-9
Online ISBN: 978-1-4471-3810-5
eBook Packages: Springer Book Archive