Efficient memo-table management strategies

DOI10.1007/BF02983374MaRDI QIDQ582879zbMATH OpenFDO

Authors Hessam Khoshnevisan

Publication date 1990

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingfunctional language HOPEmemo-functionsmemo-table

Mathematics Subject Classification ID

Theory of programming languages (68N15) Dynamic programming (90C39) Data structures (68P05)

Recommendations

• Algebraic Transformation Techniques for Functional Languages
• Applicative caching
• Verified memoization and dynamic programming
• Memoizing purely functional top-down backtracking language processors
• On sharing, memoization, and polynomial time

Cites work

• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• scientific article; zbMATH DE number 3731318 (Why is no real title available?)
• scientific article; zbMATH DE number 3744496 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3388544 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• A family of rules for recursion removal
• A synthesis of several sorting algorithms
• A system which automatically improves programs
• An example of hierarchical design and proof
• Can programming be liberated from the von Neumann style?
• Eliminating Redundant Recursive Calls.
• Elimination of recursive calls using a small table of “randomly” selected function values
• Improving programs by the introduction of recursion
• Linearisation: An optimisation for nonlinear functional programs
• On the Development of the Algebra of Functional Programs
• Transformational programming and the paragraph problem

Cited in

(7)

• Zippy Tabulations of Recursive Functions
• A bounds inference method for vector-based memoization
• Applicative caching
• Approximation of function evaluation over sequence arguments via specialized data structures
• On sharing, memoization, and polynomial time
• On sharing, memoization, and polynomial time
• Verified memoization and dynamic programming

This page was built for publication: Efficient memo-table management strategies

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