category-theory-for-programmers-in-scala
  • README
  • Category Theory for Programmers
    • preface
    • part_one
      • Category: The Essence of Composition
      • Types & Functions
      • Categories Great & Small
      • Kleisli Categories
      • Products & Coproducts
      • Simple Algebraic Data Types
      • Functors
      • Functionality
      • Function Types
      • Natural Transformations
    • part_two
      • Declarative Programming
      • Limits and Colimits
      • Free Monoids
      • Representable Functors
      • The Yoneda Lemma
      • Yoneda Embedding
    • part_three
      • It's All About Morphisms
      • Adjunctions
      • Free/Forgetful Adjunctions
      • Monads: Programmer's Definition
      • Monads & Effects
      • Monads Catagorically
      • Comonads
      • F-Algebras
      • Algebra for Monads
      • Ends & Coends
      • Kan Extensions
      • Enriched Categories
      • Topoi
      • Lawvere Theories
      • Monads, Monoids, & Categories
    • definitions
    • resources
  • changelog
Powered by GitBook
On this page
  • Functors in Programming
  • The Maybe Functor
  • Equational Reasoning
  • Optional
  • Typeclasses
  • Functor in C++
  • The List Functor
  • The Reader Functor
  • Functors as Containers
  • Functor Composition
  • Challenges
  • Acknowledgments
  1. Category Theory for Programmers
  2. part_one

Functors

PreviousSimple Algebraic Data TypesNextFunctionality

Last updated 7 years ago

This site uses cookies to deliver its service and to analyze traffic. By browsing this site, you accept the privacy policy.