Certifying and Reasoning on Cost Annotations of Functional Programs

DOI10.1007/978-3-642-32495-6_5zbMath1367.68046arXiv1110.2350OpenAlexW1538921948MaRDI QIDQ3167527

Roberto M. Amadio, Yann Régis-Gianas

Publication date: 2 November 2012

Published in: Foundational and Practical Aspects of Resource Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2350

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70)

Related Items

Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits, The verified CakeML compiler backend