Incremental computing with abstract data structures

DOI10.1007/978-3-319-29604-3_14MaRDI QIDQ2798280zbMATH OpenOpenAlexFDO

Authors Akimasa Morihata

Publication date 4 April 2016

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29604-3_14

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Efficiency by incrmentalization: An introduction
• Automata, Languages and Programming
• Monads for incremental computing
• Complexity models for incremental computation
• Bounded incremental computation

Cites work

• A short cut to parallelization theorems
• Conjugate hylomorphisms -- or: the mother of all structured recursion schemes
• Containers: Constructing strictly positive types
• Dynamizing static algorithms, with applications to dynamic trees and history independence
• Functional Pearls
• Generic downwards accumulations
• Generic functional programming with types and relations
• scientific article; zbMATH DE number 977284 (Why is no real title available?)
• scientific article; zbMATH DE number 1380900 (Why is no real title available?)
• Parallelizing functional programs by generalization
• Self-adjusting binary search trees
• The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
• The Zipper
• Typer inference builds a short cut to deforestation

Cited in

(4)

• Efficiency by incrmentalization: An introduction
• Monads for incremental computing
• A type theory for incremental computational complexity with control flow changes
• Incremental Abstract Interpretation

This page was built for publication: Incremental computing with abstract data structures

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