Denotational cost semantics for functional languages with inductive types

DOI10.1145/2784731.2784749zbMath1360.68323arXiv1506.01949OpenAlexW2094647969MaRDI QIDQ2981951

Norman Danner, Ramyaa Ramyaa, Daniel R. Licata

Publication date: 10 May 2017

Published in: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

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

zbMATH Keywords

semi-automatic complexity analysis

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (9)

Migrating gradual types ⋮ Verified Root-Balanced Trees ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language ⋮ Amortized complexity verified ⋮ Attribute-Based Signatures for Circuits from Bilinear Map ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Relational cost analysis in a functional-imperative setting

This page was built for publication: Denotational cost semantics for functional languages with inductive types