Paper: Disjunctive strictness analysis (at LICS 1992)

Authors: Thomas P. Jensen

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

BibTeX

  @InProceedings{Jensen-Disjunctivestrictne,
    author = 	 {Thomas P. Jensen},
    title = 	 {Disjunctive strictness analysis},
    booktitle =  {Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science (LICS 1992)},
    year =	 {1992},
    month =	 {June}, 
    pages =      {174--185},
    location =   {Santa Cruz, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }