Static determination of quantitative resource usage for higher-order programs

DOI10.1145/1706299.1706327zbMath1312.68039OpenAlexW2112969535MaRDI QIDQ5255076

Martin Hofmann, Steffen Jost, Kevin Hammond, Hans-Wolfgang Loidl

Publication date: 11 June 2015

Published in: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1706299.1706327

zbMATH Keywords

typesfunctional programmingresource analysis

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (13)

A type-based complexity analysis of object oriented programs ⋮ Type-based cost analysis for lazy functional languages ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation ⋮ Oracle-guided scheduling for controlling granularity in implicitly parallel languages ⋮ Unnamed Item ⋮ Linear dependent types in a call-by-value scenario ⋮ Combining linear logic and size types for implicit complexity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two decades of automatic amortized resource analysis ⋮ Implicit computation complexity in higher-order programming languages ⋮ Type-based analysis of logarithmic amortised complexity

This page was built for publication: Static determination of quantitative resource usage for higher-order programs