Contract-based resource verification for higher-order functions with memoization

DOI10.1145/3009837.3009874zbMath1380.68099OpenAlexW2565399133MaRDI QIDQ5370871

Sumith Kulal, Ravichandhran Madhavan, Viktor Kuncak

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

complexitydynamic programminglazy evaluation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Unnamed Item ⋮ Exponential automatic amortized resource analysis ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits ⋮ Amortized complexity verified ⋮ Unnamed Item

This page was built for publication: Contract-based resource verification for higher-order functions with memoization