Lazy type inference for the strictness analysis of lists
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 257-271
- https://doi.org/10.1007/3-540-57880-3_17
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Comparing the Galois connection and widening/narrowing approaches to abstract interpretationPublished by Springer Nature ,2005
- Benchmarking implementations of lazy functional languagesPublished by Association for Computing Machinery (ACM) ,1993
- Assessing the evaluation transformer model of reduction on the spineless G-machinePublished by Association for Computing Machinery (ACM) ,1993
- Strictness analysis using abstract reductionPublished by Association for Computing Machinery (ACM) ,1993
- Complete restrictions of the intersection type disciplineTheoretical Computer Science, 1992
- From operational semantics to abstract machinesMathematical Structures in Computer Science, 1992
- A syntactic approach to fixed point computation on finite domainsPublished by Association for Computing Machinery (ACM) ,1992
- Type inference with simple subtypesJournal of Functional Programming, 1991
- Fixed points and frontiers: a new perspectiveJournal of Functional Programming, 1991
- Strictness analysisPublished by Association for Computing Machinery (ACM) ,1989