Skip to search formSkip to main contentSkip to account menu

Strictness analysis

In computer science, strictness analysis refers to any algorithm used to prove that a function in a non-strict functional programming language is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Lazy evaluation is a key feature of Haskell, but can make it difficult to reason about the efficiency of programs. Improvement… 
2017
2017
We introduce rewriting of meta-expressions which stem from a meta-language that uses higher-order abstract syntax augmented by… 
2006
2006
We develop a proof method to show that in a (deterministic) lambda calculus with letrec and equipped with contextual equivalence… 
2001
2001
We introduce a constraint-based framework for strictness analysis applicable to ML style languages supporting higher-order… 
1996
1996
We present an inference system for translating programs in a PCF-like source language into a variant of Moggi's computational… 
1995
1995
This paper presents a general framework to develop strictness analysis combining the advantage of the type znference approach and… 
1994
1994
In a non-strict language, functions may return values before their arguments are available, and data structures may be defined… 
1993
1993
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algorithm. A central notion is to… 
1992
1992
The past decade has seen extensive research into the topic of strictness analysis and a rich family of analysis algorithms have… 
1987
1987
Strictness analysis applied to programs with lazy list constructors