You are seeing Ask web results for strictness analysis because there was not a match on Dictionary.com.
|
Strictness analysis - Wikipedia, the free encyclopedia
In computer science, strictness analysis refers to any algorithm used to prove that a function in a non-strict functional programming language is strict in one or more of its arguments. This informa...
en.wikipedia.org/wiki/Strictness_analysis |
|
Now, I want to talk about problems with lazy-by-default languages, and how these problems could be addressed by better strictness analysis. This will be in multiple parts. (Part 2); Let's look at a simple example where laziness causes problems.
|
||
|
Recent results in strictness analysis provide a formalisation of this notion of “need”, and thus can be adapted to analyse time complexity.The future of programming may be in this paradigm: to create software, first write a specification that is clear, and then refine it to an implementation that is efficient.
|
||
|
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algorithm. A central notion is to only ever analyse each ...
|
||
|
CiteSeerX - Document Details (Isaac Councill, Lee Giles): this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an earlier conjecture [19], and shows how the technique can be applied to first-order polymorphic functions. ... 89 Projections for strictness analysis – Wadler,
|
||
|
P. Dybjer, Inverse Image Analysis Generalises Strictness Analysis, J. Inf. and Comp. Vol 90 (2), Feb 91. ... Methods that utilize context include projection analysis [9, 35] evaluation transformer analysis [1, 2] stream strictness analysis [16] inverse image analysis [14], and Lindstrom s backwards strictness analysis [28]
|
||
|
Done at compile time ... Use approximation technique ... Back to first slide...
|
||
|
(not rated yet) ... No. First name Last name Show...
|
||
|
Paul Hudak, Jonathan Young: Higher-Order Strictness Analysis in Untyped Lambda Calculus. 97-109 ... Deborah S. Coutant: Retargetable High-Level Alias Analysis. 110-118 ... Gregor Snelting, Wolfgang Henhapl: Unification in Many-Sorted Algebras as a Device for Incremental Semantic Analysis. 229-235...
|
||
|
R. C. Sekar, Prateek Mishra, I. V. Ramakrishnan: On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation. 37-48 ... Samson Abramsky, Thomas P. Jensen: A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions. 49-54...
|
