Automatic amortised analysis of dynamic memory allocation for lazy functional programs
From MaRDI portal
Publication:5168911
Recommendations
- Type-based cost analysis for lazy functional languages
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Type-based amortized resource analysis with integers and arrays
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
Cited in
(9)- Type-based cost analysis for lazy functional languages
- The role of lazy evaluation in amortized data structures
- Static prediction of heap space usage for first-order functional programs
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Amortised Memory Analysis Using the Depth of Data Structures
- scientific article; zbMATH DE number 1161584 (Why is no real title available?)
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
- Contract-based resource verification for higher-order functions with memoization
- Two decades of automatic amortized resource analysis
This page was built for publication: Automatic amortised analysis of dynamic memory allocation for lazy functional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168911)