Cost recurrences for DML programs

DOI10.1145/507635.507666zbMATH Open1323.68118OpenAlexW1980177715MaRDI QIDQ5178014FDOQ5178014

Authors: Bernd Grobauer 

Publication date: 9 March 2015

Published in: Proceedings of the sixth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

Recommendations

• Denotational cost semantics for functional languages with inductive types
• Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
• More precise yet widely applicable cost analysis
• Topics in semantics-based program manipulation
• Closed-form upper bounds in static cost analysis

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Functional programming and lambda calculus (68N18)

Cited In (7)

• Denotational semantics as a foundation for cost recurrence extraction for functional languages
• Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs
• A transformational approach to parametric accumulated-cost static profiling
• A general framework for static profiling of parametric resource usage
• Implementation of Functional Languages
• A transformational approach to resource analysis with typed-norms inference
• Relational cost analysis in a functional-imperative setting

This page was built for publication: Cost recurrences for DML programs

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