Need help with zio-prelude?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

268 Stars 57 Forks Apache License 2.0 545 Commits 48 Opened issues


A lightweight, distinctly Scala take on functional abstractions, with tight ZIO integration

Services available


Need anything else?

Contributors list

ZIO Prelude

| CI | Release | Snapshot | Discord | | --- | --- | --- | --- | | CI | Release Artifacts | Snapshot Artifacts | Badge-Discord |


ZIO Prelude is an alternative approach to functional abstractions in Scala, which throws out the classic functor hierarchy in favor of a modular algebraic approach that is smaller, easier to understand and teach, and more expressive.

ZIO Prelude has three key areas of focus:

  • Data structures, and type classes for traversing them. ZIO Prelude embraces the collections in the Scala standard library, and extends them with new instances and new useful additions.
  • Patterns of composition for types. ZIO Prelude provides a small catalog of patterns for binary operators, which combine two values into another value of the same type. These patterns are named after the algebraic laws they satisfy: associativity, commutativity, and identity.
  • Patterns of composition for type constructors. ZIO Prelude provides a catalog of patterns for binary operators on type constructors (things like
    , ZIO
    ). These patterns are named after the algebraic laws they satisfy (associativity, commutativity, and identity) and the structure they produce, whether a tuple or an either.

The library has a small research-stage package (

) that provides abstraction over expressive effect types like ZIO and


The ZIO Prelude Microsite is currently under development.

ZIO Prelude Microsite (not available yet, in the meantime you can check those slides)


Documentation for contributors

Code of Conduct

See the Code of Conduct


Come chat with us on Badge-Discord.



We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.