dep-t: Dependency injection for records-of-functions.

[ bsd3, control, library ] [ Propose Tags ]

Put all your functions in the environment record! Let all your functions read from the environment record! No favorites!

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],,,,,,,,,,,,,,,,,,,,,,
Change log
Dependencies base (>= && <5), mtl (>=2.2), transformers (>=, unliftio-core (>= [details]
License BSD-3-Clause
Author Daniel Diaz
Category Control
Source repo head: git clone
Uploaded by DanielDiazCarrete at 2023-01-15T23:06:11Z
Reverse Dependencies 4 direct, 0 indirect [details]
Downloads 3270 total (20 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-01-15 [all 1 reports]

Readme for dep-t-

[back to package description]


This package provides various helpers for the "record-of-functions" style of structuring Haskell applications.

A record that groups related functions is considered a component. Hypothetical example:

data Repository m = Repository
  { findById :: ResourceId -> m Resource,
    save :: Resource -> m ()

The record type is the component's "interface". A component's "implementation" is defined by a constructor function that returns a value of the record type.

When starting up, applications build a dependency injection environment which contains all the required components. And components read their own dependencies from the DI environment. The DI environment is akin to an ApplicationContext in object-oriented frameworks like Java Spring.

If components knew about the concrete DI environment, that would increase coupling. Everything would depend on everything else. To avoid that, we resort to Has-style typeclasses so that each constructor function knows only about the parts of the environment that it needs, and nothing more. Those Has-style classes can be tailor-made, but this package also provides a generic one.

Hypothetical example of constructor function:

makeRepository :: (Has Logger m deps, Has SomeOtherDep m deps) => deps -> Repository m

Very loosely speaking, Has-style constraints correspond to injected constructor arguments in object-oriented DI frameworks.

Module structure

  graph TD;
  • Dep.Has provides a generic Has typeclass for locating dependencies in an environment. Usually, component implementations import this module.
  • Dep.Env complements Dep.Has with helpers for building dependency injection environments. Usually, only the composition root of the application imports this module.
  • Dep.Phases provides a Phased typeclass for DI environments which go through a sequence of Applicative phases during construction. Also a special QualifiedDo notation for phases.
  • Dep.Constructor enables fixpoint-based dependency injection in Phased environments. See this thread in the Haskell Discourse for an example.
  • Control.Monad.Dep provides the DepT monad transformer, a variant of ReaderT. You either want to use this or Dep.Constructor in your composition root, but not both.
  • Control.Monad.Dep.Class is an extension of MonadReader, useful to program against both ReaderT and DepT.
  • This library was extracted from my answer to this Stack Overflow question.

  • The implementation of mapDepT was teased out in this other SO question.

  • An SO answer about records-of-functions and the "veil of polymorphism".

  • The answers to this SO question gave me the idea for how to "instrument" monadic functions (although the original motive of the question was different).

  • I'm unsure of the relationship between DepT and the technique described in Adventures assembling records of capabilities which relies on having "open" and "closed" versions of the environment record, and getting the latter from the former by means of knot-tying.

    It seems that, with DepT, functions in the environment obtain their dependencies anew every time they are invoked. If we change a function in the environment record, all other functions which depend on it will be affected in subsequent invocations. I don't think this happens with "Adventures..." at least when changing a "closed", already assembled record.

    With DepT a function might use local if it knows enough about the environment. That doesn't seem very useful for program logic; if fact it sounds like a recipe for confusion. But it enables complex scenarios for which the dependency graph needs to change in the middle of a request.

    All in all, perhaps DepT will be overkill in a lot of cases, offering unneeded flexibility. Perhaps using fixEnv from Dep.Env will end up being simpler.

    Unlike in "Adventures..." the fixEnv method doesn't use an extensible record for the environment but, to keep things simple, a suitably parameterized conventional one.

  • Another exploration of dependency injection with ReaderT: ReaderT-OpenProduct-Environment.

  • The ReaderT design pattern.

    Your application code will, in general, live in ReaderT Env IO. Define it as type App = ReaderT Env IO if you wish, or use a newtype wrapper instead of ReaderT directly.

    Optional: instead of directly using the App datatype, write your functions in terms of mtl-style typeclasses like MonadReader and MonadIO

  • RIO is a featureful ReaderT-like / prelude replacement library which favors monomorphic environments.

  • The van Laarhoven Free Monad.

    Swierstra notes that by summing together functors representing primitive I/O actions and taking the free monad of that sum, we can produce values use multiple I/O feature sets. Values defined on a subset of features can be lifted into the free monad generated by the sum. The equivalent process can be performed with the van Laarhoven free monad by taking the product of records of the primitive operations. Values defined on a subset of features can be lifted by composing the van Laarhoven free monad with suitable projection functions that pick out the requisite primitive operations.

    Another post about the van Laarhoven Free Monad. Is it related to the final encoding of Free monads described here?

  • Interesting SO response (from 2009) about the benefits of autowiring in Spring. The record-of-functions approach in Haskell can't be said to provide true autowiring. You still need to assemble the record manually, and field names in the record play the part of Spring bean names.

    Right now I think the most important reason for using autowiring is that there's one less abstraction in your system to keep track of. The "bean name" is effectively gone. It turns out the bean name only exists because of xml. So a full layer of abstract indirections (where you would wire bean-name "foo" into bean "bar") is gone

  • registry is a package that implements an alternative approach to dependency injection, one different from the ReaderT-based one.

  • Printf("%s %s", dependency, injection). Commented on HN, Lobsters.

  • Dependency Injection Principles, Practices, and Patterns This is a good book on the general princples of DI.

  • A series of posts—by one of the authors of the DI book—about building a DI container.

  • Lessons learned while writing a Haskell application. This post recommends a "polymorphic record of functions" style, which fits the philosophy of this library.

  • One big disadvantage of the records-of-functions approach:

    representing effects as records of functions rather than typeclasses/fused effect invocations destroys inlining, so you’ll generate significantly worse Core if you use this on a hot path.

  • ReaderT pattern is just extensible effects