Jul 6, 2005 · This paper presents a framework for comparing two strictness analysis techniques: Abstract interpretation and non-standard type inference.
We give a proof of the main theorem, that the strictness logic can prove exactly those strictness properties that we could find by abstract interpretation.
Strictness Analysis in Logical Form. Author: Thomas P. JensenAuthors Info & Claims.
A formal system for deducing inclusions between ideals of a lattice is presented and proved sound and complete, which establishes the main result that ...
Strictness analysis in logical form. Author: Thomas P. Jensen.
This paper presents a framework for comparing two strictness analysis techniques: Abstract interpretation and non-standard type inference.
In programming languages, typing systems are used to ensure consistency of function applications: the type of each function argument should match some specified ...
Strictness analysis attempts to determine the "divergence properties" of functions, which thus identifies some functions that are strict.
Missing: Logical | Show results with:Logical
Abstract. We define a novel inference system for strictness and totality analysis for the simply- typed lazy lambda-calculus with constants and fixpoints.
We define a novel inference system for strictness and totality analysis for the simply-typed lazy lambda-calculus with constants and fixpoints.