Title :
Disjunctive strictness analysis
Author :
Jensen, Thomas P.
Author_Institution :
Imperial Coll., London, UK
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 λ-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 :
formal languages; formal logic; programming theory; disjunctive strictness analysis; disjunctive types; functional language; program logic; typed lambda -calculus; Algorithm design and analysis; Computer languages; Educational institutions; Inference algorithms; Lattices; Logic design; Logic programming; Tensile stress; Writing;
Conference_Titel :
Logic in Computer Science, 1992. LICS '92., Proceedings of the Seventh Annual IEEE Symposium on
Conference_Location :
Santa Cruz, CA
Print_ISBN :
0-8186-2735-2
DOI :
10.1109/LICS.1992.185531
