recursion-schemes: init at 5.2.2.4

horizon.dhall

@@ -4,6 +4,7 @@ let H =
 let packages =
       { formatting = H.callHackage "formatting" "7.2.0"
       , polysemy = H.callHackage "polysemy" "1.9.1.0"
+      , recursion-schemes = H.callHackage "recursion-schemes" "5.2.2.4"
       , type-errors = H.callHackage "type-errors" "0.2.0.2"
       , unagi-chan = H.callHackage "unagi-chan" "0.4.1.4"
       }

horizon.lock

@@ -6,6 +6,10 @@
   , mapValue =
       "b134fcf0c950011e7c4bb8c074b99f70b11d26de8db9fa05db498008dae61cdb"
   }
+, { mapKey = "recursion-schemes"
+  , mapValue =
+      "4fd1545bb00d723c31149fa5266684bf89be3e3765c0c6229b80d18ef8529ea4"
+  }
 , { mapKey = "type-errors"
   , mapValue =
       "9a6f7b5c1c3b6f5641d84da2df9661c507251df438da179a9926941422e31bc1"

overlay.nix

@@ -5,6 +5,8 @@ final: prev: with pkgs.haskell.lib; {
 
   polysemy = final.callPackage (./pkgs/polysemy.nix) { };
 
+  recursion-schemes = final.callPackage (./pkgs/recursion-schemes.nix) { };
+
   type-errors = final.callPackage (./pkgs/type-errors.nix) { };
 
   unagi-chan = final.callPackage (./pkgs/unagi-chan.nix) { };

pkgs/recursion-schemes.nix

+{ mkDerivation, HUnit, base, base-orphans, comonad, containers
+, data-fix, free, lib, template-haskell, th-abstraction
+, transformers
+}:
+mkDerivation {
+  pname = "recursion-schemes";
+  version = "5.2.2.4";
+  sha256 = "0c151bc90a9a28bab2beced0e450103e102f754ddfebb8f924fc8a3b11c4db43";
+  revision = "2";
+  editedCabalFile = "1617jz77d4f2hf54jfz30zbf18rcgl6h0nzn3rcl0gjxjavf5aq6";
+  isLibrary = true;
+  isExecutable = false;
+  enableSeparateDataOutput = false;
+  libraryHaskellDepends = [
+    base base-orphans comonad containers data-fix free template-haskell
+    th-abstraction transformers
+  ];
+  testHaskellDepends = [ base HUnit template-haskell transformers ];
+  enableLibraryProfiling = true;
+  enableExecutableProfiling = true;
+  doHaddock = false;
+  jailbreak = true;
+  doCheck = false;
+  doBenchmark = false;
+  hyperlinkSource = false;
+  homepage = "http://github.com/ekmett/recursion-schemes/";
+  description = "Representing common recursion patterns as higher-order functions";
+  license = lib.licenses.bsd2;
+  broken = false;
+}
\ No newline at end of file