Name
Abstract | ||
|---|---|---|
We present a static analysis for determining the execution costs of lazily evaluated functional languages, such as Haskell. Time- and space-behaviour of lazy functional languages can be hard to predict, creating a significant barrier to their broader acceptance. This paper applies a type-based analysis employing amortisation and cost effects to statically determine upper bounds on evaluation costs. While amortisation performs well with finite recursive data, we significantly improve the precision of our analysis for co-recursive programs (i.e. dealing with potentially infinite data structures) by tracking self-references. Combining these two approaches gives a fully automatic static analysis for both recursive and co-recursive definitions. The analysis is formally proven correct against an operational semantic that features an exchangeable parametric cost-model. An arbitrary measure can be assigned to all syntactic constructs, allowing to bound, for example, evaluation steps, applications, allocations, etc. Moreover, automatic inference only relies on first-order unification and standard linear programming solving. Our publicly available implementation demonstrates the practicability of our technique on editable non-trivial examples. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10817-016-9398-9 | J. Autom. Reasoning |
Keywords | Field | DocType |
Automated static analysis,Lazy evaluation,Corecursion,Amortised analysis,Type systems,Functional programming | Data structure,Programming language,Functional programming,Corecursion,Computer science,Unification,Static analysis,Lazy evaluation,Algorithm,Theoretical computer science,Haskell,Recursion | Journal |
Volume | Issue | ISSN |
59 | 1 | 0168-7433 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steffen Jost | 1 | 247 | 12.36 |
| Pedro B. Vasconcelos | 2 | 8 | 1.12 |
| Mário Florido | 3 | 122 | 14.44 |
| Kevin Hammond | 4 | 175 | 17.81 |