Skip to main content
SpringerLink
Log in

A generic program for sequential decision processes

  • Invited Talks
  • Conference paper
  • First Online:
Programming Languages: Implementations, Logics and Programs (PLILP 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 982))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

    Google Scholar 

  2. R. C. Backhouse, P. De Bruin, G. Malcolm, T. S. Voermans, and J. C. S. P. Van der Woude. Relational catamorphisms. In B. Möller, editor, Proceedings of the IFIP TC2/WG2.1 Working Conference on Constructing Programs, pages 287–318. Elsevier Science Publishers B.V., 1991.

    Google Scholar 

  3. Roland Backhouse, Henk Doornbos, and Paul Hoogendijk. Commuting relators. Technical Report. Available by anonymous ftp from ftp.win.tue.nl, directory pub/math. prog. construction., 1992.

    Google Scholar 

  4. R. Bellman. Dynamic Programming. Princeton University Press, 1957.

    Google Scholar 

  5. R. S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, volume 36 of NATO ASI Series F, pages 3–42. Springer-Verlag, 1987.

    Google Scholar 

  6. R. S. Bird and O. de Moor. List partitions. Formal Aspects of Computing, 5(1):61–78, 1993.

    Google Scholar 

  7. R. S. Bird and O. de Moor. Solving optimisation problems with catamorphisms. In Mathematics of Program Construction, volume 669 of Springer Lecture Notes in Computer Science, 1993.

    Google Scholar 

  8. R. S. Bird and O. de Moor. Algebra of Programming. Prentice-Hall, To appear, 1996.

    Google Scholar 

  9. R. S. Bird, P. Hoogendijk, and O. de Moor. Generic programming with relations and functors. Submitted to Journal of Functional Programming, 1993.

    Google Scholar 

  10. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT electrical engineering and computer science series. MIT Press, Cambridge, Mass.; London/McGraw-Hill, New York, 1990.

    Google Scholar 

  11. E. V. Denardo. Dynamic Programming — Models and Applications. Prentice-Hall, 1982.

    Google Scholar 

  12. D. Eppstein, Z. Galil, R. Giancarlo, and G. F. Italiano. Sparse dynamic programming II: Convex and concave cost functions. Journal of the ACM, 39:546–567, 1992.

    Google Scholar 

  13. A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988.

    Google Scholar 

  14. P. Helman and A. Rosenthal. A comprehensive model of dynamic programming. SIAM Journal on Algebraic and Discrete Methods, 6(2):319–334, 1985.

    Google Scholar 

  15. D. S. Hirschberg and L. L. Larmore. The least weight subsequence problem. SIAM Journal on Computing, 16(4):628–638, 1987.

    Google Scholar 

  16. B. Jay. Matrices, monads and the Fast Fourier transform. Available by anonymous ftp from ftp.socs.uts.edu.au directory pub/jay, August 1993.

    Google Scholar 

  17. J. Jeuring. Polytypic pattern matching. In S. Peyton Jones, editor, Proceedings of the 7th Conference on Functional Programming Languages and Computer Architecture, FPCA '91, 1995.

    Google Scholar 

  18. D. S. Johnson and K. A. Niemi. On knapsacks, partitions, and a new dynamic programming technique for trees. Mathematics of Operations Research, 8(1):1–15, 1983.

    Google Scholar 

  19. R.M. Karp and M. Held. Finite-state processes and dynamic programming. SIAM Journal on Applied Mathematics, 15(3):693–718, 1967.

    Google Scholar 

  20. E. Meijer and G. Hutton. Bananas in space: extending fold and unfold to exponential types. In S. Peyton Jones, editor, Proceedings of the 7th Conference on Functional Programming Languages and Computer Architecture, FPCA '91, 1995.

    Google Scholar 

  21. E. Meijer and M. Jones. Gofer goes bananas. Unpublished manuscript, 1994.

    Google Scholar 

  22. M. Z. Ning. A lazy algorithm for the 0/1 knapsack problem. Technical Report (to appear), Oxford University Computing Laboratory, 1995.

    Google Scholar 

  23. D. R. Smith and M. R. Lowry. Algorithm theories and design tactics. Science of Computer Programming, 14:305–321, 1990.

    Google Scholar 

  24. D.R. Smith. Structure and design of problem reduction generators. In B. Möller, editor, Proc. of the IFIP TC2 Working Conference on Constructing Programs from Specifications. North-Holland, 1991.

    Google Scholar 

  25. F. F. Yao. Speed-up in dynamic programming. SIAM Journal on Algebraic and Discrete Methods, 3(4):532–540, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Oege de Moor

Authors
  1. Oege de Moor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manuel Hermenegildo S. Doaitse Swierstra

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Moor, O. (1995). A generic program for sequential decision processes. In: Hermenegildo, M., Swierstra, S.D. (eds) Programming Languages: Implementations, Logics and Programs. PLILP 1995. Lecture Notes in Computer Science, vol 982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026809

Download citation

  • DOI: https://doi.org/10.1007/BFb0026809

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60359-7

  • Online ISBN: 978-3-540-45048-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation