Recursion Schemes for Dynamic Programming
From MaRDI portal
Publication:3618825
DOI10.1007/11783596_15zbMath1235.68055DBLPconf/mpc/KabanovV06OpenAlexW1552676905WikidataQ62043267 ScholiaQ62043267MaRDI QIDQ3618825
Publication date: 2 April 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11783596_15
Nonnumerical algorithms (68W05) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (5)
Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ The Expression Lemma ⋮ A short cut to optimal sequences ⋮ Some Remarks on Type Systems for Course-of-value Recursion ⋮ Two extensions of system F with (co)iteration and primitive (co)recursion principles
This page was built for publication: Recursion Schemes for Dynamic Programming
