Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,272,705 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Abstract interpretation
Calling convention
Compiler
Computer science
Expand
Broader (1)
Static program analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Improving Haskell
Martin A. T. Handley
,
G. Hutton
Symposium on Trends in Functional Programming
2018
Corpus ID: 46903861
Lazy evaluation is a key feature of Haskell, but can make it difficult to reason about the efficiency of programs. Improvement…
Expand
2017
2017
Fachbereich Informatik und Mathematik Rewriting of Higher-Order-Meta-Expressions with Recursive Bindings
David Sabel
2017
Corpus ID: 96456166
We introduce rewriting of meta-expressions which stem from a meta-language that uses higher-order abstract syntax augmented by…
Expand
2006
2006
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec
M. Schmidt-Schauß
2006
Corpus ID: 12395373
We develop a proof method to show that in a (deterministic) lambda calculus with letrec and equipped with contextual equivalence…
Expand
2001
2001
Effective Strictness Analysis with HORN Constraints
Kevin Glynn
,
Peter James Stuckey
,
Martin Sulzmann
Sensors Applications Symposium
2001
Corpus ID: 17389745
We introduce a constraint-based framework for strictness analysis applicable to ML style languages supporting higher-order…
Expand
1996
1996
Tea: a System for Proving Termination of a Non-strict Higher-order Functional Language
Manfred Schmidt-Schau
1996
Corpus ID: 17726568
reduction: approximation: e; e! # e0 ej e0 C[e]; e nf-terminates C[e] j C[Te] context-skip: branching: f e1 : : : en; (f nf…
Expand
1994
1994
Partitioning non-strict languages for multi-threaded code generation
S. Coorg
1994
Corpus ID: 28887901
In a non-strict language, functions may return values before their arguments are available, and data structures may be defined…
Expand
1993
1993
Polymorphic strictness analysis using frontiers
J. Seward
ACM SIGPLAN Workshop on Partial Evaluation and…
1993
Corpus ID: 10293134
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algorithm. A central notion is to…
Expand
1992
1992
A precise relationship between the deductive power of forward and backward strictness analysis
M. Neuberger
,
Prateek Mishra
LFP '92
1992
Corpus ID: 8748715
The past decade has seen extensive research into the topic of strictness analysis and a rich family of analysis algorithms have…
Expand
1990
1990
Higher-order strictness analysis over non-flat domains
C. Ernoult
1990
Corpus ID: 124008655
Strictness analysis has been investigated in order to cover in one hand higher-order strictness analysis, on the other hand…
Expand
1987
1987
Strictness analysis applied to programs with lazy list constructors
Cordelia V. Hall
1987
Corpus ID: 63158900
Strictness analysis applied to programs with lazy list constructors