Efficiency by incrmentalization: An introduction

DOI10.1023/A:1026547031739MaRDI QIDQ1595470zbMATH OpenOpenAlexFDO

Authors Yanhong A. Liu

Publication date 6 November 2001

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1026547031739

zbMATH Keywords

incrementalization

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Systematic derivation of incremental programs
• Complexity models for incremental computation
• Incremental computing with abstract data structures
• Dynamic programming via static incrementalization
• Strengthening invariants for efficient computation

Cited in

(16)

• Efficient handling of data structures in definitional languages
• Complexity models for incremental computation
• Dynamic programming via static incrementalization
• Systematic derivation of incremental programs
• Incremental programming language development
• Incremental computing with abstract data structures
• Refinement types for incremental computational complexity
• Foundations of differential dataflow
• Monads for incremental computing
• A type theory for incremental computational complexity with control flow changes
• Iterate, incrementalize, and implement: a systematic approach to efficiency improvement and guarantees
• Strengthening invariants for efficient computation
• Fixing incremental computation. Derivatives of fixpoints, and the recursive semantics of Datalog
• Incremental -calculus in cache-transfer style. Static memoization by program transformation
• Analytical differential calculus with integration
• Derivation of efficient logic programs by specialization and reduction of nondeterminism

This page was built for publication: Efficiency by incrmentalization: An introduction

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