Build Status Windows build status Hackage Stackage LTS Stackage Nightly License: MIT

A custom prelude used in Serokell.

What is this?

This README contains introduction to Universum and a tutorial on how to use it.

Structure of this tutorial

This tutorial has several parts:

  1. Philosophy and motivation.
  2. How to use universum.
  3. Changes in Prelude (some gotchas).
  4. Already known things that weren't in Prelude brought into scope.
  5. New things added.

This is not a tutorial on Haskell, and not even a tutorial on each function. For the detailed documentation of every function with examples and usages see Haddock documentation.

Why another custom Prelude?


In Serokell, we want to be as much productive as possible. That's why we are using Haskell. This choice of language implies that we're restricted to use Prelude: implicit import of basic functions, type classes and data types. But the default Prelude is considered to be not so good due to some historical reasons.

This is why we decided to use a better tool. Hopefully Haskell provides us with ability to replace default Prelude with some alternative. All we need to do is to implement new basic set of defaults. But we don't intend to implement everything from scratch. There're already plenty of preludes. After some hot long discussions our team decided to base our custom prelude on protolude. If you're not familiar with it, you can read a tutorial about protolude.

The next section explains why we have made this choice and what we are willing to do. This tutorial doesn't cover the differences from protolude. Instead, it explains how Universum is different from custom Prelude.

Main goals

While creating and maintaining a custom prelude, we are pursuing the following goals:

  1. Avoid all partial functions. We like total and exception-free functions. Though you can still use some unsafe functions from Universum.Unsafe module but they are not exported by default.
  2. Use more efficient string representations. String type is crushingly inefficient. All our functions either try to be polymorphic over string types, or use Text as the default string type. String type alias is still reexported, because the community is evolving slowly, some libraries still use String type. But we recommend to avoid String!
  3. Don't reinvent the wheel. We're not trying to rebuild whole type hierarchy from scratch, as it's done in classy-prelude. Instead, we reexport common and well-known things from base and some other libraries used in everyday production programming in Haskell. > Note: well, we did end up inventing something new.
  4. Export more useful and commonly used functions. Hello, my name is Dmitry. I was coding Haskell for 3 years but still hoogling which module liftIO comes from. Things like liftIO, ReaderT type, MVar-related functions have unambiguous names, are used in almost every non-trivial project, and it's really tedious to import them manually every time.

Unlike protolude, we are:

  1. Not trying to be as general as possible (thus we don't export much from GHC.Generics).
  2. Not trying to maintain every version of ghc compiler (only the latest 3
  3. Trying to make writing production code easier (see enhancements and fixes).

How to use Universum

Okay, enough philosophy. If you want to just start using universum and explore it with the help of compiler, set everything up according to the instructions below.

Disable the built-in prelude at the top of your file:

{-# LANGUAGE NoImplicitPrelude #-}

Or directly in your project .cabal file, if you want to use in every module by default:

default-extensions: NoImplicitPrelude

Then add the following import to your modules:

import Universum

If you're using Emacs, you can modify your configs a little bit if you don't want to type import Universum manually every time.


  • head, tail, last, init work with NonEmpty a instead of [a].
  • Safe analogue for head function: safeHead :: [a] -> Maybe a.
  • undefined triggers a compiler warning, which is probably not what you want. Either use throwIO, Except, error or bug.
  • map is fmap now.
  • Multiple sorting functions are available without imports: + sortBy :: (a -> a -> Ordering) -> [a] -> [a]: sorts list using given custom comparator. + sortWith :: Ord b => (a -> b) -> [a] -> [a]: sorts a list based on some property of its elements. + sortOn :: Ord b => (a -> b) -> [a] -> [a]: just like sortWith, but more time-efficient if function is calculated slowly (though less space-efficient). So you should write sortOn length (would sort elements by length) but sortWith fst (would sort list of pairs by first element).
  • Functions sum and product are strict now, which makes them more efficient.
  • If you try to do something like putStrLn "hi", you'll get an error message if OverloadedStrings is enabled – it happens because the compiler doesn't know what type to infer for the string. Use putTextLn in this case.
  • Since show doesn't come from Show anymore, you can't write Show instances easily. Either use autoderived instances or Buildable.
  • You can't call some Foldable methods over Maybe and some other types. Foldable generalization is useful but potentially error-prone. Instead we created our own fully compatible with Foldable Container type class but that restricts the usage of functions like length over Maybe, Either, Identity and tuples. We're also using GHC 8 feature of custom compile-time errors to produce more helpful messages.
  • As a consequence of previous point, some functions like traverse_, forM_, sequenceA_, etc. are generalized over Container type classes.
  • error takes Text.

Things that you were already using, but now you don't have to import them explicitly

Commonly used libraries

First of all, we reexport some generally useful modules: Control.Applicative, Data.Traversable, Data.Monoid, Control.DeepSeq, Data.List, and lots of others. Just remove unneeded imports after importing Universum (GHC should tell you which ones).

Then, some commonly used types: Map/HashMap/IntMap, Set/HashSet/IntSet, Seq, Text and ByteString (as well as synonyms LText and LByteString for lazy versions).

liftIO and MonadIO are exported by default. A lot of IO functions are generalized to MonadIO.

deepseq is exported. For instance, if you want to force deep evaluation of some value (in IO), you can write evaluateNF a. WHNF evaluation is possible with evaluateWHNF a.

We also reexport big chunks of these libraries: mtl, stm, microlens, microlens-mtl.

Bifunctor type class with useful instances is exported.

  • first and second functions apply a function to first/second part of a tuple (for tuples).
  • bimap takes two functions and applies them to first and second parts respectively.


We export Text and LText, and some functions work with Text instead of String – specifically, IO functions (readFile, putStrLn, etc) and show. In fact, show is polymorphic and can produce strict or lazy Text, String, or ByteString. Also, toText/toLText/toString can convert Text|LText|String types to Text/LText/String. If you want to convert to and from ByteString use encodeUtf8/decodeUtf8 functions.

Debugging and undefineds

trace, traceM, traceShow, etc. are available by default. GHC will warn you if you accidentally leave them in code, however (same for undefined).

We also have data Undefined = Undefined (which, too, comes with warnings).


We use safe-exceptions library for exceptions handling. Don't import Control.Exceptions module explicitly. Instead use functionality from safe-exceptions provided by universum or import Control.Exceptions.Safe module.

What's new?

Finally, we can move to part describing the new cool features we bring with universum.

  • uncons splits a list at the first element.
  • ordNub and sortNub are O(n log n) versions of nub (which is quadratic) and hashNub and unstableNub are almost O(n) versions of nub.
  • (&) – reverse application. x & f & g instead of g $ f $ x is useful sometimes.
  • pretty and prettyL for converting Buildable into Text (suggested be used instead of show).
  • whenM, unlessM, ifM, guardM are available and do what you expect them to do (e.g. whenM (doesFileExist "foo")).
  • Very generalized version of concatMapM, too, is available and does what expected.
  • readMaybe and readEither are like read but total and give either Maybe or Either with parse error.
  • when(Just|Nothing|Left|Right|NotEmpty)[M][_] let you conditionally execute something. Before:

    case mbX of
        Nothing -> return ()
        Just x  -> ... x ...


    whenJust mbX $ \x ->
        ... x ...
  • for_ for loops. There's also forM_ but for_ looks a bit nicer.

    for_ [1..10] $ \i -> do
  • andM, allM, anyM, orM are monadic version of corresponding functions from base.
  • Type operator $ for writing types like Maybe $ Either String $ Maybe Int.
  • Each type family. So this:

    f :: Each [Show, Read] [a, b] => a -> b -> String

    translates into this:

    f :: (Show a, Show b, Read a, Read b) => a -> b -> String
  • With type operator. So this:

    a :: With [Show, Read] a => a -> a

    translates into this:

    a :: (Show a, Read a) => a -> a
  • Variadic composition operator (...). So you can write:

    ghci> (show ... (+)) 1 2
    ghci> show ... 5
    ghci> (null ... zip5) [1] [2] [3] [] [5]
    ghci> let process = map (+3) ... filter
    ghci> process even [1..5]
  • Conversions between Either and Maybe like rightToMaybe and maybeToLeft with clear semantic.
  • using(Reader|State)[T] functions as aliases for flip run(Reader|State)[T].
  • One type class for creating singleton containers. Even monomorhpic ones like Text.
  • evaluateWHNF and evaluateNF functions as clearer and lifted aliases for evaluate and evaluate . force.
  • ToPairs type class for data types that can be converted to list of pairs (like Map or HashMap or IntMap).

Projects that use Universum


Released under the MIT License. Copyright (c) 2016, Stephen Diehl, 2016-2017, Serokell



  • #144: Add Exc pattern synonym.
  • #60: Reexport Natural type from Numeric.Natura module.
  • #118: Reexport Type from Data.Kind module.
  • #130: Merge ToList and Container type classes into single type class Container.
  • #15: Add ?: function to Universum.Monad.Maybe.
  • #128: Add Unsafe module with unsafe functions to works with lists and Maybe.
  • #129: Reexport id.
  • #136: Change foldl' type back, add flipfoldl' instead.

  • #127: Fix doctest for text-1.2.3.


  • #53: Add doctest to universum. Also imporove and fix documentation.
  • #117: Drop the support of GHC-8.0.1.
  • #104: Reexport hashWithSalt from Data.Hashable.
  • #95: Reexport Compose from Data.Functor.Compose.
  • #124: Export methods of class Exception.


  • #114: Reexport more functions from safe-exceptions.


  • #91: Change argument order of foldl'.
  • #97: Add ToPairs type class with the ability to have list of pairs.


  • #100: Add bug function = impureThrow.


  • #90: Improve project structure.
  • #89: Add export of Universum.Nub module to Universum.
  • Add listToMaybe to Universum.Monad.Reexport.
  • #81: Make putText and putLText to be versions of putStr. Add putTextLn and putLTextLn -- versions of putStrLn.
  • #5: Add safe versions of head, tail, init, last functions for NonEmpty list. Old head (which returns Maybe) is renamed to safeHead. Reexports from safe are removed.
  • Remove unsnoc (this function is very slow and shouldn't be used).
  • #88: Add HasCallStack => to error and undefined functions.
  • #58: Make Element type family be associated type family. Remove {-# OVERLAPPABLE #-} instance for ToList and Container. Add default instances for basic types. Remove WrappedList newtype because it's not needed anymore. Remove NontrivialContainer constraint alias.
  • #56: Make elem and notElem faster for Set and HashSet by introducing ElementConstraint associated type family.
  • Remove Unsafe module. Though, see issue #128 for disuccion regarding possible return of this module.


  • Change base version to be < 5.


  • #79: Import '(<>)' from Semigroup, not Monoid.
  • Improve travis configartion.
  • #80: Rename Container to ToList, NontrivialContainer to Container. Keep NontrivialContainer as type alias.
  • Rename Containers module to Container.Class.
  • Move all container-related reexports from Universum to Container.Reexport.
  • Add default implementation of null function.
  • Add WrappedList newtype with instance of Container.
  • Improve compile time error messages for disallowed instances.


  • #83: Change the order of types in show and print functions.
  • Move string related reexports and functions to Conv module.
  • Rename Conv module to String.
  • Move print function to Print module.
  • #77: Add modify' function to export list.

  • #69: Document SuperComposition operator (...).


  • #68: Separate all 'nub' functions to Nub module, add sortNub and unstableNub there.
  • #54: Reorganize .cabal.
  • #21: Add benchmarks.
  • #65: Use TypeNats instead of TypeLits when possible.


  • #47: Reexport put and get for MonadState.
  • #48: Export boxed Vector type.
  • #49: Export IdentityT and runIdentityT.
  • #51: Add fromRight and fromLeft that behave like fromMaybe but for Either.
  • #52: Add maybeToMonoid :: Monoid m => Maybe m -> m.
  • Remove Symbol-related types for sure.
  • Return back seems to be useful function guardM removed in v0.3.
  • Add notElem for NonTrivialContainer.


  • Fixed version number bug (it had 4 numbers).

  • #62: Export exceptions-related functions from 'safe-exceptions'.


  • Fix an infinite loop in decodeUtf8 from Text to ByteString.Lazy.


  • Export MonadTrans typeclass.
  • Remove Symbol-related exports from GHC.TypeLits.
  • Remove SrcLoc and Location reexports from GHC.ExecutionStack.
  • Add With type operator.
  • Add hashNub.
  • Export strict StateT instead of lazy.


  • Assign associativity and priority to (...), export typeclass itself.


  • #25: Add vararg functions composition operator (...).
  • Rewrite concatMapM & concatForM so that they allow traversed and returned-by-function container types differ.


  • Reexport sortWith from GHC.Exts.


  • Add haddock documentation with 100% coverage.
  • Rewrite README tutorial.
  • #37: Add generalized version of readEither.
  • #38: Add evaluateNF, evaluateNF_, evaluateWHNF, evaluateWHNF_.
  • #39: Add lifted versions of IORef functions.
  • Remove foreach
  • Reexport (&&&) from Control.Arrow.
  • Add lifted version of readTVarIO.
  • interact and getContents work with Lazy Text.
  • Reexport MaybeT, maybeToExceptT, exceptToMaybeT.


  • #28: Remove putByteString and putLByteString.
  • #29: Remove panic, FatalError and notImplemented. Rename NotImplemented into Undefined.
  • #32: Remove orAlt, orEmpty, liftAA2, eitherA, purer, <<*>>, traceIO, guardM, hush, tryIO, liftM', liftM2', applyN, guardedA, Bifunctor instances for tuples of length higher than 2. Generalize concatMapM, add concatForM and operator versions.
  • #35: Generalize andM, orM, allM, anyM over container type.


  • #33: Add ($) and Each type operators.


  • #24: Add whenNothing, whenNothing_, whenNothingM, whenNothingM_, whenLeft, whenLeftM, whenRight, whenRightM, whenNotNull, whenNotNullM.
  • #26: Add usingReader, usingReaderT, usingState, usingStateT, executingState, executingStateT, evaluatingState, evaluatingStateT.
  • Remove maybeToEither.


  • Add one (similar to singleton).
  • Expose Symbol and Nat types from GHC.TypeLits by default.
  • Export genericLength and other generic list return functions.
  • Rename msg to fatalErrorMessage.
  • Export ExceptT
  • Export ReaderT, and StateT constructors.
  • Export NonEmpty type and constructor for Base 4.9 only.
  • Export Data.Semigroup type and functions for Base 4.9 only.
  • Export String.


  • Add lenses from microlens.
  • Add (<&>).
  • Reexport (&) from Data.Function if it's present there instead of always defining our own (this is actually done by reexporting it from Lens.Micro which does the right thing).
  • Fix a space leak in whenJust.


  • Use custom classes instead of Foldable. Thanks to this, length and similar functions can't anymore be used on tuples or Maybe, but can be used on e.g. Text, ByteString and IntSet.

  • Add allM, anyM, andM, orM.

  • Reexport fail and MonadFail.


  • Expose putByteString and putLByteString monomorphic versions of putStrLn functions
  • Switch exported (<>) to be from Data.Monoid instead of Semigroup.
  • Export Hashable


  • Generalize most IO functions to MonadIO
  • Make die available for older versions of base


  • Make sum and product strict


  • foreach for applicative traversals.
  • hush function for error handling.
  • tryIO function for error handling.
  • pass function for noop applicative branches.
  • Mask Handler typeclass export.
  • Mask yield function export.


  • Export monadic (>>) operator by default.
  • Add traceId and traceShowId functions.
  • Exportreader and state functions by default.
  • Export lifted throwIO and throwTo functions.


  • Add uncatchable panic exception throwing using Text message.
  • Remove printf
  • Remove string-conv dependency so Stack build works without extra-deps.
  • Bring Callstack machinery in for GHC 8.x.
  • Remove throw and assert from Control.Exception exports.
  • Remove unsafeShiftL and unsafeShiftR from Data.Bits exports.
  • Reexport throw as unsafeThrow via Unsafe module.
  • Hides all Show class functions. Only the Class itself is exported. Forbids custom instances that are not GHC derived.
  • ExportencodeUtf8`` anddecodeUtf8`` functions by default.
  • Adds unsnoc function.


  • Initial release.
comments powered byDisqus