A type theory for incremental computational complexity with control flow changes

DOI10.1145/2951913.2951950zbMATH Open1361.68062OpenAlexW2514317887MaRDI QIDQ2982007FDOQ2982007

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

Recommendations

• Refinement types for incremental computational complexity
• Complexity models for incremental computation
• Efficiency by incrmentalization: An introduction
• Bounded incremental computation
• Incremental computing with abstract data structures

zbMATH Keywords

complexity analysisincremental computationtype and effect systems

Mathematics Subject Classification ID

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

Cited In (2)

• Type-Based Complexity Analysis for Fork Processes
• 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

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