Type-based cost analysis for lazy functional languages

DOI10.1007/s10817-016-9398-9zbMath1409.68067OpenAlexW2569392808MaRDI QIDQ2398175

Kevin Hammond, Pedro Vasconcelos, Mário Florido, Steffen Jost

Publication date: 15 August 2017

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10023/12441

zbMATH Keywords

lazy evaluationfunctional programmingtype systemscorecursionamortised analysisautomated static analysis

Mathematics Subject Classification ID

Related Items (6)

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ Tight typings and split bounds, fully developed ⋮ Unnamed Item ⋮ Two decades of automatic amortized resource analysis ⋮ Type-based analysis of logarithmic amortised complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Region-based memory management
• Automated higher-order complexity analysis
• Automatic Static Cost Analysis for Parallel Programs
• Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
• Recursion and dynamic data-structures in bounded space
• Static prediction of heap space usage for first-order functional programs
• Lightweight semiformal time complexity analysis for purely functional data structures
• Amortized Computational Complexity
• Deriving a lazy abstract machine
• Purely Functional Data Structures
• Polymorphic type, region and effect inference
• Automatic amortised analysis of dynamic memory allocation for lazy functional programs
• Static determination of quantitative resource usage for higher-order programs
• Type-based amortized resource analysis with integers and arrays
• Multivariate amortized resource analysis
• Programming Languages and Systems

This page was built for publication: Type-based cost analysis for lazy functional languages