Recursion Schemes for Dynamic Programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4014 LNCS, Issue , 2006, Pages 235-252

  Kabanov, Jevgeni ^a   Vene, Varmo ^a  

^a UNIVERSITY OF TARTU   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BINARY SEQUENCES; COMPUTATION THEORY; COMPUTER SCIENCE; RECURSIVE FUNCTIONS;

ALGORITHM DESIGN TECHNIQUES; DYNAMORPHISM; RECURSION COMBINATOR; RECURSION PATTERN;

DYNAMIC PROGRAMMING;

EID: 33746035705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11783596_15     Document Type: Conference Paper

References (12)

1. Bellman, R.: Dynamic Programming. Princeton Univ. Press, Princeton, NJ (1957)
2. Bird, R.S.: An introduction to the theory of lists. In Broy, M., ed.: Logic of Programming and Calculi of Discrete Design. Vol. 36 of NATO ASI Series F. Springer-Verlag, Berlin (1987) 3-42
3. Bird, R., de Moor, O.: Algebra of Programming. Vol. 100 of Prentice Hall Int. Series in Computer Science. Prentice Hall, London (1997)
4. Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inform, and Comput. 204(4) (2006) 437-468
5. Fokkinga, M.: Law and Order in Algorithmics. PhD thesis. Dept. of Informatics, Univ. of Twente (1992)
6. Gibbons, J.: Calculating functional programs. In Backhouse, R.C., Croie, R.L., Gibbons, J., eds.: Revised Lectures from Int. Summer School and Wksh. on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Vol. 2297 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin (2000) 149-202
7. Hagino, T.: A Categorical Programming Language. PhD thesis CST-47-87. Laboratory for Foundations of Computer Science, Dept. of Computer Science, Univ. of Edinburgh (1987)
8. Malcolm, G.: Data structures and program transformation. Sci. of Comput. Program. 14(2-3) (1990) 255-279
9. Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In Hughes, J., ed.: Proc. of 5th ACM Conf. on Functional Programming Languages and Computer Architecture, FPCA '91. Vol. 523 of Lect. Notes in Comput. Sci. Springer-Verlag, Berlin (1991) 124-144
10. Uustalu, T., Vene, V.: Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica 10(1) (1999) 5-26
11. Uustalu, T., Vene, V., Pardo, A.: Recursion schemes from comonads. Nordic J. of Computing 8(3) (2001) 366-390
12. Vene, V.: Categorical Programming with Inductive and Coinductive Types. PhD thesis. Vol. 23 of Diss. Math. Univ. Tartuensis. Dept. of Computer Science, Univ. of Tartu (2000)