Calculational derivation of pointer algorithms from tree operations

DOI10.1016/S0167-6423(98)00016-1MaRDI QIDQ1283882zbMATH OpenOpenAlexFDO

Authors K. Appert, Michael J. Butler

Publication date 10 November 1999

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6423(98)00016-1

zbMATH Keywords

pointer algorithmstree-based pointer structures

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• Pure Pointer Programs and Tree Isomorphism
• scientific article; zbMATH DE number 3854413
• A complexity calculus for recursive tree algorithms
• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
• Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
• scientific article; zbMATH DE number 2084334
• Towards pointer algebra
• Vectorization of tree traversals

Cited in

(8)

• On building cyclic and shared structures in Haskell
• Calculating with acyclic and cyclic lists
• scientific article; zbMATH DE number 2084334 (Why is no real title available?)
• Pure Pointer Programs and Tree Isomorphism
• Blaming the client: on data refinement in the presence of pointers
• Towards pointer algebra
• Formalization of Refinement Calculus for Reactive Systems
• Algebra of Monotonic Boolean Transformers

This page was built for publication: Calculational derivation of pointer algorithms from tree operations

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