Skip to main content
SpringerLink
Log in

Allegories as a basis for algorithmics

  • Conference paper
  • First Online:
Category Theory and Computer Science (CTCS 1997)

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

Included in the following conference series:

  • 221 Accesses

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. R.C. Backhouse and P.F. Hoogendijk. Elements of a relational theory of datatypes. In B. Möller, H. Partsch, and S. Schuman, editors, Formal Program Development, volume LNCS 755, pages 7–42. Springer-Verlag, 1993.

    Google Scholar 

  2. R. Bird and O. de Moor. Algebra of Programming. International Series in Computing Science. Prentice Hall, 1996.

    Google Scholar 

  3. R. S. Bird, P. F. Hoogendijk, and O. De Moor. Generic programming with relations and functors. Journal of Functional Programming, 6(1):1–28, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. R.H. Connelly and F. Lockwood Morris. A generalisation of the trie data structure. Mathematical Structures in Computer Science, 5(3):381–418, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  5. S. Curtis. A relational approach to optimization problems. DPhil. thesis, Computing Laboratory, Oxford, UK, 1996.

    Google Scholar 

  6. O. de Moor. Categories, Relations and Dynamic Programming. DPhil. thesis, Computing Laboratory, Oxford, UK, 1992. published in Mathematical Structures in Computer Science, volume 4, pp 33–70 (1994).

    Google Scholar 

  7. O. de Moor. An exercise in polytypic programming: Repmin. Programming Research Group, Oxford University, 1996.

    Google Scholar 

  8. P. J. Freyd and A. Ščedrov. Categories, Allegories, volume 39 of Mathematical Library. North-Holland, 1990.

    Google Scholar 

  9. R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989.

    Google Scholar 

  10. D.H. Greene and D.E. Knuth. Mathematics for the Analysis of Algorithms. Progress in Computer Science. Birkhäuser, 1982.

    Google Scholar 

  11. T. Hagino. Category theoretic approach to data types. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, UK, 1987. Technical Report ECS-LFCS-87-38.

    Google Scholar 

  12. J. Jeuring. Polytypic pattern matching. In S. Peyton Jones, editor, Functional Programming and Computer Architecture, pages 238–248. Association for Computing Machniery, 1995.

    Google Scholar 

  13. B. Korte, L. Lovasz, and R. Schrader. Greedoids, volume 4 of Algorithms and Combinatorics. Springer-Verlag, 1991.

    Google Scholar 

  14. E.G. Manes and M.A. Arbib. Algebraic Approaches to Program Semantics. Texts and Monographs in Computing Science. Springer-Verlag, 1986.

    Google Scholar 

  15. L. Meertens. Calculate polytypically! In PLILP Conference, Lecture Notes in Computer Science. Springer-Verlag, 1996.

    Google Scholar 

  16. E. Meijer. Calculating Compilers. Ph.D thesis, University of Nijmegen, The Netherlands, 1992.

    Google Scholar 

  17. C. Okasaki. Purely Functional Data Structures. Ph.D thesis, School of Computer Science, Carnegie Mellon University, 1996. *** DIRECT SUPPORT *** A0008C33 00002

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Richard S. Bird

Authors
  1. Richard S. Bird
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eugenio Moggi Giuseppe Rosolini

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bird, R.S. (1997). Allegories as a basis for algorithmics. In: Moggi, E., Rosolini, G. (eds) Category Theory and Computer Science. CTCS 1997. Lecture Notes in Computer Science, vol 1290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026979

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63455-3

  • Online ISBN: 978-3-540-69552-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation