Static determination of quantitative resource usage for higher-order programs

DOI10.1145/1706299.1706327MaRDI QIDQ5255076zbMATH OpenOpenAlexFDO

Authors Steffen Jost, Kevin Hammond, Martin Hofmann, 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

functional programmingresource analysistypes

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Towards automatic resource bound analysis for OCaml
• Automatic Static Cost Analysis for Parallel Programs
• Type-based amortized resource analysis with integers and arrays
• Type-based amortized resource analysis with integers and arrays
• Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs

Cited in

(25)

• A type-based complexity analysis of object oriented programs
• Combining linear logic and size types for implicit complexity
• Type-based cost analysis for lazy functional languages
• A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation
• Linear dependent types in a call-by-value scenario
• Last mile's resources
• A transformational approach to parametric accumulated-cost static profiling
• A framework for verification and debugging of resource usage properties: resource usage verification
• Automatic inference of resource consumption bounds
• Resource Analysis by Sup-interpretation
• A general framework for static profiling of parametric resource usage
• Combining linear logic and size types for implicit complexity
• Denotational semantics as a foundation for cost recurrence extraction for functional languages
• scientific article; zbMATH DE number 7204445 (Why is no real title available?)
• Resource Usage Analysis for the Pi-Calculus
• Contract-based resource verification for higher-order functions with memoization
• Towards automatic resource bound analysis for OCaml
• Oracle-guided scheduling for controlling granularity in implicitly parallel languages
• Improvements to a resource analysis for Hume
• Static complexity analysis of higher order programs
• Two decades of automatic amortized resource analysis
• Implicit computation complexity in higher-order programming languages
• Type-based analysis of logarithmic amortised complexity
• scientific article; zbMATH DE number 7756108 (Why is no real title available?)
• Typable fragments of polynomial automatic amortized resource analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255076)