Abstract
Lenient languages, such as Id Nouveau, have been proposed for programming parallel computers. These languages represent a compromise between strict and lazy languages. The operation of parallel languages is very complex; therefore a formal method for reasoning about their performance is desirable. This paper presents a non-standard denotational semantics for calculating the performance of lenient programs. The semantics is novel in its use of time and time-stamps.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B Bjerner, S Holmstrom. A compositional approach to time analysis of first order lazy functional programs. In 1989 ACM Conference on Functional Programming Languages and Computer Architecture, London, pages 157–165, 1989.
D L Eager, J Zahorjan, E D Lazowska. Speedup versus efficiency in parallel systems. Technical Report 86–08–01, Dept. of Computational Science, University of Sasketchewan, August 1986.
C Hankin, G Burn, S L Peyton Jones. A safe approach to parallel combinator reduction. Theoretical Computer Science, 56: 17–36, 1988.
D Harrison. Ruth: A functional language for real-time programming. In PARLE, pages 297–314, 1987.
P Hudak, S Anderson. Pomset interpretations of parallel functional programs In Proceedings IFIP Conference on Functional Programming Languages and Computer Architecture, Portland, pages 234–256. Springer Verlag LNCS 274, September 1987.
S B Jones. Investigation of performance achievable with highly concurrent interpretations of functional programs. Final Report, ESPIRIT project 302, October 1987.
D LeMétayer. Mechanical analysis of program complexity. ACM SIG-PLAN Symposium on Programming Languages and Programming Environments, 20 (7), 1985.
R S Nikhil, K Pingali, Arvind. Id Nouveau. Technical Report memo 265, Computational Structures Group, Laboratory for Computer Science, MIT, July 1986.
P Roe. Parallel Programming using Functional Languages. PhD thesis, Department of Computing Science, University of Glasgow, in preparation.
M Rosendahl. Automatic complexity analysis. In 1989 ACM Conference on Functional Programming Languages and Computer Architecture, London, pages 144–156, 1989.
D Sands. Complexity analysis for a lazy higher order language. In K Davis and J Hughes, editors, Functional Programming: Proceedings of the 1989 Glasgow Workshop, 21–23 August 1989, Fraserburgh„ Scotland, Springer Workshops in Computing. Springer Verlag, July 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roe, P. (1991). Calculating lenient programs’ performance. 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_19
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3810-5_19
Publisher Name: Springer, London
Print ISBN: 978-3-540-19667-9
Online ISBN: 978-1-4471-3810-5
eBook Packages: Springer Book Archive