Incremental Computing with Abstract Data Structures

DOI10.1007/978-3-319-29604-3_14zbMath1475.68100OpenAlexW2405068887MaRDI QIDQ2798280

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic downwards accumulations
• Containers: Constructing strictly positive types
• Typer inference builds a short cut to deforestation
• Conjugate Hylomorphisms -- Or
• Functional Pearls
• Self-adjusting binary search trees
• The Zipper
• Generic functional programming with types and relations
• Parallelizing functional programs by generalization
• A short cut to parallelization theorems
• The third homomorphism theorem on trees

This page was built for publication: Incremental Computing with Abstract Data Structures