Refinement types for incremental computational complexity

DOI10.1007/978-3-662-46669-8_17MaRDI QIDQ2802443zbMATH OpenOpenAlexFDO

Authors Ezgi Çiçek, Deepak Garg, Umut A. Acar

Publication date 26 April 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46669-8_17

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A type theory for incremental computational complexity with control flow changes
• Complexity models for incremental computation
• Efficiency by incrmentalization: An introduction
• Monads for incremental computing
• Adaptive functional programming

Cited in

(4)

• A type theory for incremental computational complexity with control flow changes
• scientific article; zbMATH DE number 1303639 (Why is no real title available?)
• Type-Based Complexity Analysis for Fork Processes
• scientific article; zbMATH DE number 7204445 (Why is no real title available?)

This page was built for publication: Refinement types for incremental computational complexity

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