Disjunctive strictness analysis
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 174-185
- https://doi.org/10.1109/lics.1992.185531
Abstract
The problem of constructing a disjunctive strictness analysis for a higher-order, functional language is addressed. A system of disjunctive types for strictness analysis of typed lambda -calculus is introduced, and the types are used to define a program logic for strictness analysis. A disjunctive abstract interpretation is then obtained as a sound and complete model of the program logic. The results extend earlier work on using the tensor product of lattices to analyze disjunctive properties of programs by abstract interpretation.Keywords
This publication has 5 references indexed in Scilit:
- The tensor product in Wadler's analysis of listsPublished by Springer Nature ,1992
- The Abstract Interpretation of Higher-Order Functional Languages: From Properties to Abstract DomainsPublished by Springer Nature ,1992
- Strictness analysisPublished by Association for Computing Machinery (ACM) ,1989
- Strictness analysis for higher-order functionsScience of Computer Programming, 1986
- The tensor product of continuous latticesMathematische Zeitschrift, 1980