A transformation method for dynamic-sized tabulation

DOI10.1007/BF01177742zbMath0824.68015OpenAlexW4242121630MaRDI QIDQ1892705

Masami Hagiya, Wei-Ngan Chin

Publication date: 21 June 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01177742

zbMATH Keywords

tuplingdynamic-sized tabulationlambda abstractions

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using circular programs to eliminate multiple traversals of data
• Partial parametrization eliminates multiple traversals of data structures
• Eliminating Redundant Recursive Calls.
• A Transformation System for Developing Recursive Programs
• The Equivalence of Certain Computations

This page was built for publication: A transformation method for dynamic-sized tabulation