Complexity analysis for a lazy higher-order language
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 361-376
- https://doi.org/10.1007/3-540-52592-0_74
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Backwards Strictness Analysis: Proved and ImprovedPublished by Springer Nature ,1990
- A relationship between abstract interpretation and projection analysisPublished by Association for Computing Machinery (ACM) ,1990
- A composition approach to time analysis of first order lazy functional programsPublished by Association for Computing Machinery (ACM) ,1989
- Automatic complexity analysisPublished by Association for Computing Machinery (ACM) ,1989
- Strictness analysis aids time analysisPublished by Association for Computing Machinery (ACM) ,1988
- Automating program analysisJournal of the ACM, 1988
- Projections for strictness analysisPublished by Springer Nature ,1987
- Mechanical analysis of program complexityPublished by Association for Computing Machinery (ACM) ,1985
- Mechanical program analysisCommunications of the ACM, 1975