A type-based framework for program analysis
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 380-394
- https://doi.org/10.1007/3-540-58485-4_53
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Deriving algorithms from type inference systemsPublished by Association for Computing Machinery (ACM) ,1994
- Lazy type inference for the strictness analysis of listsPublished by Springer Nature ,1994
- Strictness properties of lazy algebraic datatypesPublished by Springer Nature ,1993
- A Logical Framework for Program AnalysisPublished by Springer Nature ,1993
- Complete restrictions of the intersection type disciplineTheoretical Computer Science, 1992
- From operational semantics to abstract machinesMathematical Structures in Computer Science, 1992
- Binding time analysisPublished by Association for Computing Machinery (ACM) ,1991
- Strictness analysis in logical formPublished by Springer Nature ,1991
- Fixed points and frontiers: a new perspectiveJournal of Functional Programming, 1991
- Strictness analysisPublished by Association for Computing Machinery (ACM) ,1989