A short cut to optimal sequences

DOI10.1007/s00354-010-0098-4zbMath1251.68072OpenAlexW1985162296MaRDI QIDQ1758658

Akimasa Morihata

Publication date: 16 November 2012

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00354-010-0098-4

zbMATH Keywords

dynamic programmingprogram transformationfunctional programmingshortcut fusion

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18) Theory of software (68N99)

Uses Software

• Haskell
• GHC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Longest segment problems
• Dynamic programming via static incrementalization
• A discipline of dynamic programming over sequence data
• Maximum marking problems
• Typer inference builds a short cut to deforestation
• Make it practical
• Eliminating Redundant Recursive Calls.
• Easy problems for tree-decomposable graphs
• Recursion Schemes for Dynamic Programming
• Categories, relations and dynamic programming
• Write it recursively
• Tupling calculation eliminates multiple data traversals
• Theoretical Aspects of Computing – ICTAC 2005

This page was built for publication: A short cut to optimal sequences