Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Workshop on Coalgebraic Methods in Computer Science

CMCS 2012: Coalgebraic Methods in Computer Science pp 51–70Cite as

  1. Home
  2. Coalgebraic Methods in Computer Science
  3. Conference paper
On Finitary Functors and Their Presentations

On Finitary Functors and Their Presentations

  • Jiří Adámek18,
  • Stefan Milius18 &
  • Lawrence S. Moss19 
  • Conference paper
  • 578 Accesses

  • 3 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7399)

Abstract

Finitary endofunctors of locally presentable categories are proved to have equational presentations. Special attention is paid to the Hausdorff functor of non-empty compact subsets of a complete metric space.

Keywords

  • Finitary functors
  • Hausdorff functor
  • presentation of functors

Download conference paper PDF

References

  1. Abramsky, S., Jung, A.: Domain Theory. In: Handbook of Logic in Computer Science. Clarendon Press, Oxford (1994)

    Google Scholar 

  2. Adámek, J.: Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carolinae 15, 589–609 (1974)

    MathSciNet  MATH  Google Scholar 

  3. Adámek, J., Rosický, J.: Locally Presentable and Accessible Categories. Cambridge University Press (1993)

    Google Scholar 

  4. Adámek, J., Trnková, V.: Automata and Algebras in Categories. Kluwer Academic Publ., Dordrecht (1990)

    MATH  Google Scholar 

  5. Adámek, J., Trnková, V.: Relatively terminal coalgebras. To appear in J. Pure Appl. Algebra

    Google Scholar 

  6. Barr, M.: Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci. 114, 299–315 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Borceux, F.: Handbook of Categorical Algebra, vol. 2. Cambridge University Press (1994)

    Google Scholar 

  8. van Breugel, F., Hermida, C., Makkai, M., Worrell, J.: Recursively defined metric spaces without contraction

    Google Scholar 

  9. Kelly, G.M., Power, J.: Adjunctions whose counits are coequalizers and presentations of finitary enriched monads. J. Pure Appl. Algebra 89, 163–179 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Lawvere, F.W.: Functional semantics of algebraic theories. Dissertation, Columbia University (1963)

    Google Scholar 

  11. Makkai, M., Paré, R.: Accessible Categories. Amer. Math. Soc., Providence, Rhode Island (1989)

    Google Scholar 

  12. Velebil, J., Kurz, A.: Equational presentations of functors and monads. Math. Structures Comput. Sci. 21, 363–381 (2011)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, Technische Universität Braunschweig, Germany

    Jiří Adámek & Stefan Milius

  2. Department of Mathematics, Indiana University, Bloomington, IN, USA

    Lawrence S. Moss

Authors
  1. Jiří Adámek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Milius
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lawrence S. Moss
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research School of Information Sciences and Engineering, The Australian National University, 0200, Canberra, ACT, Australia

    Dirk Pattinson

  2. Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058, Erlangen, Germany

    Lutz Schröder

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Adámek, J., Milius, S., Moss, L.S. (2012). On Finitary Functors and Their Presentations. In: Pattinson, D., Schröder, L. (eds) Coalgebraic Methods in Computer Science. CMCS 2012. Lecture Notes in Computer Science, vol 7399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32784-1_4

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-32784-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32783-4

  • Online ISBN: 978-3-642-32784-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature