A type theory for incremental computational complexity with control flow changes

From MaRDI portal

Revision as of 21:04, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2982007

Jump to:navigation, search

DOI10.1145/2951913.2951950zbMath1361.68062OpenAlexW2514317887MaRDI QIDQ2982007

Ezgi Çiçek, Deepak Garg, Zoe Paraskevopoulou

Publication date: 10 May 2017

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

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

zbMATH Keywords

complexity analysis incremental computation type and effect systems

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 (1)

Relational cost analysis in a functional-imperative setting

Uses Software

ML

This page was built for publication: A type theory for incremental computational complexity with control flow changes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2982007&oldid=15992869"