diff --git a/Agda.Builtin.Bool.html b/Agda.Builtin.Bool.html index d66fa1a..4b7d192 100644 --- a/Agda.Builtin.Bool.html +++ b/Agda.Builtin.Bool.html @@ -1,5 +1,5 @@ -Agda.Builtin.BoolSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
+Agda.Builtin.BoolSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
             --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Bool where
diff --git a/Agda.Builtin.Char.Properties.html b/Agda.Builtin.Char.Properties.html
index abd831b..2445bea 100644
--- a/Agda.Builtin.Char.Properties.html
+++ b/Agda.Builtin.Char.Properties.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.Char.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.Char.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Char.Properties where
 
diff --git a/Agda.Builtin.Char.html b/Agda.Builtin.Char.html
index d200775..3de6831 100644
--- a/Agda.Builtin.Char.html
+++ b/Agda.Builtin.Char.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.CharSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
+Agda.Builtin.CharSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
             --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Char where
diff --git a/Agda.Builtin.Equality.html b/Agda.Builtin.Equality.html
index 2507163..eab64ec 100644
--- a/Agda.Builtin.Equality.html
+++ b/Agda.Builtin.Equality.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.EqualitySource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.EqualitySource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Equality where
 
diff --git a/Agda.Builtin.Float.Properties.html b/Agda.Builtin.Float.Properties.html
index d12a6ed..a5984ed 100644
--- a/Agda.Builtin.Float.Properties.html
+++ b/Agda.Builtin.Float.Properties.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.Float.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.Float.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Float.Properties where
 
diff --git a/Agda.Builtin.Float.html b/Agda.Builtin.Float.html
index dcba085..95b5821 100644
--- a/Agda.Builtin.Float.html
+++ b/Agda.Builtin.Float.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.FloatSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.FloatSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Float where
 
diff --git a/Agda.Builtin.Int.html b/Agda.Builtin.Int.html
index 8c545c4..6bc7d5b 100644
--- a/Agda.Builtin.Int.html
+++ b/Agda.Builtin.Int.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.IntSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.IntSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Int where
 
diff --git a/Agda.Builtin.List.html b/Agda.Builtin.List.html
index 4424fc7..2691cd1 100644
--- a/Agda.Builtin.List.html
+++ b/Agda.Builtin.List.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.ListSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.ListSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.List where
 
diff --git a/Agda.Builtin.Maybe.html b/Agda.Builtin.Maybe.html
index 8751b75..880e3cd 100644
--- a/Agda.Builtin.Maybe.html
+++ b/Agda.Builtin.Maybe.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.MaybeSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.MaybeSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Maybe where
 
diff --git a/Agda.Builtin.Nat.html b/Agda.Builtin.Nat.html
index 62a67fd..db66d14 100644
--- a/Agda.Builtin.Nat.html
+++ b/Agda.Builtin.Nat.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.NatSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
+Agda.Builtin.NatSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
             --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Nat where
diff --git a/Agda.Builtin.Reflection.Properties.html b/Agda.Builtin.Reflection.Properties.html
index ff80d80..cb83668 100644
--- a/Agda.Builtin.Reflection.Properties.html
+++ b/Agda.Builtin.Reflection.Properties.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.Reflection.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.Reflection.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Reflection.Properties where
 
diff --git a/Agda.Builtin.Reflection.html b/Agda.Builtin.Reflection.html
index 93df546..c335808 100644
--- a/Agda.Builtin.Reflection.html
+++ b/Agda.Builtin.Reflection.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.ReflectionSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.ReflectionSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Reflection where
 
diff --git a/Agda.Builtin.Sigma.html b/Agda.Builtin.Sigma.html
index d0a36bd..167581f 100644
--- a/Agda.Builtin.Sigma.html
+++ b/Agda.Builtin.Sigma.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.SigmaSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.SigmaSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Sigma where
 
diff --git a/Agda.Builtin.Strict.html b/Agda.Builtin.Strict.html
index c68ac5c..01bc5d2 100644
--- a/Agda.Builtin.Strict.html
+++ b/Agda.Builtin.Strict.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.StrictSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.StrictSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Strict where
 
diff --git a/Agda.Builtin.String.Properties.html b/Agda.Builtin.String.Properties.html
index e05651d..15d63f1 100644
--- a/Agda.Builtin.String.Properties.html
+++ b/Agda.Builtin.String.Properties.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.String.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.String.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.String.Properties where
 
diff --git a/Agda.Builtin.String.html b/Agda.Builtin.String.html
index a7f2284..253662c 100644
--- a/Agda.Builtin.String.html
+++ b/Agda.Builtin.String.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.StringSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.StringSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.String where
 
diff --git a/Agda.Builtin.Unit.html b/Agda.Builtin.Unit.html
index 43d04bf..5075c9c 100644
--- a/Agda.Builtin.Unit.html
+++ b/Agda.Builtin.Unit.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.UnitSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
+Agda.Builtin.UnitSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
             --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Unit where
diff --git a/Agda.Builtin.Word.Properties.html b/Agda.Builtin.Word.Properties.html
index 763447c..a043e08 100644
--- a/Agda.Builtin.Word.Properties.html
+++ b/Agda.Builtin.Word.Properties.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.Word.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
+Agda.Builtin.Word.PropertiesSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Word.Properties where
 
diff --git a/Agda.Builtin.Word.html b/Agda.Builtin.Word.html
index fe7bcab..8454fe0 100644
--- a/Agda.Builtin.Word.html
+++ b/Agda.Builtin.Word.html
@@ -1,5 +1,5 @@
 
-Agda.Builtin.WordSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
+Agda.Builtin.WordSource code on Github
{-# OPTIONS --cubical-compatible --safe --no-universe-polymorphism
             --no-sized-types --no-guardedness --level-universe #-}
 
 module Agda.Builtin.Word where
diff --git a/Agda.Primitive.html b/Agda.Primitive.html
index 9ad88ae..aa10301 100644
--- a/Agda.Primitive.html
+++ b/Agda.Primitive.html
@@ -1,5 +1,5 @@
 
-Agda.PrimitiveSource code on Github
-- The Agda primitives (preloaded).
+Agda.PrimitiveSource code on Github
-- The Agda primitives (preloaded).
 
 {-# OPTIONS --cubical-compatible --no-import-sorts --level-universe #-}
 
diff --git a/Algebra.Apartness.Bundles.html b/Algebra.Apartness.Bundles.html
index b7fcac6..dbe3791 100644
--- a/Algebra.Apartness.Bundles.html
+++ b/Algebra.Apartness.Bundles.html
@@ -1,5 +1,5 @@
 
-Algebra.Apartness.BundlesSource code on Github
------------------------------------------------------------------------
+Algebra.Apartness.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bundles for local algebraic structures
diff --git a/Algebra.Apartness.Structures.html b/Algebra.Apartness.Structures.html
index 1a56f04..c953d3e 100644
--- a/Algebra.Apartness.Structures.html
+++ b/Algebra.Apartness.Structures.html
@@ -1,5 +1,5 @@
 
-Algebra.Apartness.StructuresSource code on Github
------------------------------------------------------------------------
+Algebra.Apartness.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Algebraic structures with an apartness relation
diff --git a/Algebra.Apartness.html b/Algebra.Apartness.html
index 2089775..aa73711 100644
--- a/Algebra.Apartness.html
+++ b/Algebra.Apartness.html
@@ -1,5 +1,5 @@
 
-Algebra.ApartnessSource code on Github
------------------------------------------------------------------------
+Algebra.ApartnessSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Algebraic objects with an apartness relation
diff --git a/Algebra.Bundles.Raw.html b/Algebra.Bundles.Raw.html
index 9f3a275..2f3b64b 100644
--- a/Algebra.Bundles.Raw.html
+++ b/Algebra.Bundles.Raw.html
@@ -1,5 +1,5 @@
 
-Algebra.Bundles.RawSource code on Github
------------------------------------------------------------------------
+Algebra.Bundles.RawSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions of 'raw' bundles
diff --git a/Algebra.Bundles.html b/Algebra.Bundles.html
index a6efbe3..f87f8e9 100644
--- a/Algebra.Bundles.html
+++ b/Algebra.Bundles.html
@@ -1,5 +1,5 @@
 
-Algebra.BundlesSource code on Github
------------------------------------------------------------------------
+Algebra.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions of algebraic structures like monoids and rings
diff --git a/Algebra.Consequences.Base.html b/Algebra.Consequences.Base.html
index 0e1a5c2..bba5612 100644
--- a/Algebra.Consequences.Base.html
+++ b/Algebra.Consequences.Base.html
@@ -1,5 +1,5 @@
 
-Algebra.Consequences.BaseSource code on Github
------------------------------------------------------------------------
+Algebra.Consequences.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lemmas relating algebraic definitions (such as associativity and
diff --git a/Algebra.Consequences.Propositional.html b/Algebra.Consequences.Propositional.html
index a6dfa06..86bb363 100644
--- a/Algebra.Consequences.Propositional.html
+++ b/Algebra.Consequences.Propositional.html
@@ -1,5 +1,5 @@
 
-Algebra.Consequences.PropositionalSource code on Github
------------------------------------------------------------------------
+Algebra.Consequences.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Relations between properties of functions, such as associativity and
diff --git a/Algebra.Consequences.Setoid.html b/Algebra.Consequences.Setoid.html
index 3b7dda6..25c60e3 100644
--- a/Algebra.Consequences.Setoid.html
+++ b/Algebra.Consequences.Setoid.html
@@ -1,5 +1,5 @@
 
-Algebra.Consequences.SetoidSource code on Github
------------------------------------------------------------------------
+Algebra.Consequences.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Relations between properties of functions, such as associativity and
diff --git a/Algebra.Construct.LiftedChoice.html b/Algebra.Construct.LiftedChoice.html
index d80860d..010936c 100644
--- a/Algebra.Construct.LiftedChoice.html
+++ b/Algebra.Construct.LiftedChoice.html
@@ -1,5 +1,5 @@
 
-Algebra.Construct.LiftedChoiceSource code on Github
------------------------------------------------------------------------
+Algebra.Construct.LiftedChoiceSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Choosing between elements based on the result of applying a function
diff --git a/Algebra.Construct.NaturalChoice.Base.html b/Algebra.Construct.NaturalChoice.Base.html
index 2e6008b..0f4bd5d 100644
--- a/Algebra.Construct.NaturalChoice.Base.html
+++ b/Algebra.Construct.NaturalChoice.Base.html
@@ -1,5 +1,5 @@
 
-Algebra.Construct.NaturalChoice.BaseSource code on Github
------------------------------------------------------------------------
+Algebra.Construct.NaturalChoice.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Basic definition of an operator that computes the min/max value
diff --git a/Algebra.Construct.NaturalChoice.Max.html b/Algebra.Construct.NaturalChoice.Max.html
index 52c9780..49760f4 100644
--- a/Algebra.Construct.NaturalChoice.Max.html
+++ b/Algebra.Construct.NaturalChoice.Max.html
@@ -1,5 +1,5 @@
 
-Algebra.Construct.NaturalChoice.MaxSource code on Github
------------------------------------------------------------------------
+Algebra.Construct.NaturalChoice.MaxSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The max operator derived from an arbitrary total preorder.
diff --git a/Algebra.Construct.NaturalChoice.MaxOp.html b/Algebra.Construct.NaturalChoice.MaxOp.html
index d1ed4b3..275ea24 100644
--- a/Algebra.Construct.NaturalChoice.MaxOp.html
+++ b/Algebra.Construct.NaturalChoice.MaxOp.html
@@ -1,5 +1,5 @@
 
-Algebra.Construct.NaturalChoice.MaxOpSource code on Github
------------------------------------------------------------------------
+Algebra.Construct.NaturalChoice.MaxOpSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of a max operator derived from a spec over a total
diff --git a/Algebra.Construct.NaturalChoice.Min.html b/Algebra.Construct.NaturalChoice.Min.html
index af51d85..44f783b 100644
--- a/Algebra.Construct.NaturalChoice.Min.html
+++ b/Algebra.Construct.NaturalChoice.Min.html
@@ -1,5 +1,5 @@
 
-Algebra.Construct.NaturalChoice.MinSource code on Github
------------------------------------------------------------------------
+Algebra.Construct.NaturalChoice.MinSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The min operator derived from an arbitrary total preorder.
diff --git a/Algebra.Construct.NaturalChoice.MinMaxOp.html b/Algebra.Construct.NaturalChoice.MinMaxOp.html
index 47d603c..390ac5a 100644
--- a/Algebra.Construct.NaturalChoice.MinMaxOp.html
+++ b/Algebra.Construct.NaturalChoice.MinMaxOp.html
@@ -1,5 +1,5 @@
 
-Algebra.Construct.NaturalChoice.MinMaxOpSource code on Github
------------------------------------------------------------------------
+Algebra.Construct.NaturalChoice.MinMaxOpSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of min and max operators specified over a total
diff --git a/Algebra.Construct.NaturalChoice.MinOp.html b/Algebra.Construct.NaturalChoice.MinOp.html
index 470c7c6..6c29ccf 100644
--- a/Algebra.Construct.NaturalChoice.MinOp.html
+++ b/Algebra.Construct.NaturalChoice.MinOp.html
@@ -1,5 +1,5 @@
 
-Algebra.Construct.NaturalChoice.MinOpSource code on Github
------------------------------------------------------------------------
+Algebra.Construct.NaturalChoice.MinOpSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of a min operator derived from a spec over a total
diff --git a/Algebra.Core.html b/Algebra.Core.html
index fbfe03f..085a919 100644
--- a/Algebra.Core.html
+++ b/Algebra.Core.html
@@ -1,5 +1,5 @@
 
-Algebra.CoreSource code on Github
------------------------------------------------------------------------
+Algebra.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core algebraic definitions
diff --git a/Algebra.Definitions.RawMagma.html b/Algebra.Definitions.RawMagma.html
index c5c7444..8ec888d 100644
--- a/Algebra.Definitions.RawMagma.html
+++ b/Algebra.Definitions.RawMagma.html
@@ -1,5 +1,5 @@
 
-Algebra.Definitions.RawMagmaSource code on Github
------------------------------------------------------------------------
+Algebra.Definitions.RawMagmaSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Basic auxiliary definitions for magma-like structures
diff --git a/Algebra.Definitions.RawMonoid.html b/Algebra.Definitions.RawMonoid.html
index 76f1aa3..1d21fb4 100644
--- a/Algebra.Definitions.RawMonoid.html
+++ b/Algebra.Definitions.RawMonoid.html
@@ -1,5 +1,5 @@
 
-Algebra.Definitions.RawMonoidSource code on Github
------------------------------------------------------------------------
+Algebra.Definitions.RawMonoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Basic auxiliary definitions for monoid-like structures
diff --git a/Algebra.Definitions.RawSemiring.html b/Algebra.Definitions.RawSemiring.html
index 76a5c9f..60c960b 100644
--- a/Algebra.Definitions.RawSemiring.html
+++ b/Algebra.Definitions.RawSemiring.html
@@ -1,5 +1,5 @@
 
-Algebra.Definitions.RawSemiringSource code on Github
------------------------------------------------------------------------
+Algebra.Definitions.RawSemiringSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Basic auxiliary definitions for semiring-like structures
diff --git a/Algebra.Definitions.html b/Algebra.Definitions.html
index a94071e..ac5373e 100644
--- a/Algebra.Definitions.html
+++ b/Algebra.Definitions.html
@@ -1,5 +1,5 @@
 
-Algebra.DefinitionsSource code on Github
------------------------------------------------------------------------
+Algebra.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of functions, such as associativity and commutativity
diff --git a/Algebra.Function.html b/Algebra.Function.html
index 48df84c..a8470f2 100644
--- a/Algebra.Function.html
+++ b/Algebra.Function.html
@@ -1,5 +1,5 @@
 
-Algebra.FunctionSource code on Github
{-# OPTIONS --safe --without-K #-}
+Algebra.FunctionSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 open import Level
 open import Algebra.Lattice
diff --git a/Algebra.Lattice.Bundles.Raw.html b/Algebra.Lattice.Bundles.Raw.html
index c26ed61..a79c24d 100644
--- a/Algebra.Lattice.Bundles.Raw.html
+++ b/Algebra.Lattice.Bundles.Raw.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Bundles.RawSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Bundles.RawSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions of 'raw' bundles
diff --git a/Algebra.Lattice.Bundles.html b/Algebra.Lattice.Bundles.html
index 67a314f..74166c7 100644
--- a/Algebra.Lattice.Bundles.html
+++ b/Algebra.Lattice.Bundles.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.BundlesSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions of algebraic structures like semilattices and lattices
diff --git a/Algebra.Lattice.Construct.NaturalChoice.MaxOp.html b/Algebra.Lattice.Construct.NaturalChoice.MaxOp.html
index dfe877e..0dbd754 100644
--- a/Algebra.Lattice.Construct.NaturalChoice.MaxOp.html
+++ b/Algebra.Lattice.Construct.NaturalChoice.MaxOp.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Construct.NaturalChoice.MaxOpSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Construct.NaturalChoice.MaxOpSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of a max operator derived from a spec over a total
diff --git a/Algebra.Lattice.Construct.NaturalChoice.MinMaxOp.html b/Algebra.Lattice.Construct.NaturalChoice.MinMaxOp.html
index 353d2c4..38404ab 100644
--- a/Algebra.Lattice.Construct.NaturalChoice.MinMaxOp.html
+++ b/Algebra.Lattice.Construct.NaturalChoice.MinMaxOp.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Construct.NaturalChoice.MinMaxOpSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Construct.NaturalChoice.MinMaxOpSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of min and max operators specified over a total preorder.
diff --git a/Algebra.Lattice.Construct.NaturalChoice.MinOp.html b/Algebra.Lattice.Construct.NaturalChoice.MinOp.html
index 8dc0456..cb4031b 100644
--- a/Algebra.Lattice.Construct.NaturalChoice.MinOp.html
+++ b/Algebra.Lattice.Construct.NaturalChoice.MinOp.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Construct.NaturalChoice.MinOpSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Construct.NaturalChoice.MinOpSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of a min operator derived from a spec over a total
diff --git a/Algebra.Lattice.Morphism.LatticeMonomorphism.html b/Algebra.Lattice.Morphism.LatticeMonomorphism.html
index d202da7..7656f01 100644
--- a/Algebra.Lattice.Morphism.LatticeMonomorphism.html
+++ b/Algebra.Lattice.Morphism.LatticeMonomorphism.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Morphism.LatticeMonomorphismSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Morphism.LatticeMonomorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Consequences of a monomorphism between lattice-like structures
diff --git a/Algebra.Lattice.Morphism.Structures.html b/Algebra.Lattice.Morphism.Structures.html
index 5678d61..af4be53 100644
--- a/Algebra.Lattice.Morphism.Structures.html
+++ b/Algebra.Lattice.Morphism.Structures.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Morphism.StructuresSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Morphism.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Morphisms between algebraic lattice structures
diff --git a/Algebra.Lattice.Properties.BooleanAlgebra.html b/Algebra.Lattice.Properties.BooleanAlgebra.html
index 0a2ed82..ede3f4a 100644
--- a/Algebra.Lattice.Properties.BooleanAlgebra.html
+++ b/Algebra.Lattice.Properties.BooleanAlgebra.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Properties.BooleanAlgebraSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Properties.BooleanAlgebraSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some derivable properties of Boolean algebras
diff --git a/Algebra.Lattice.Properties.DistributiveLattice.html b/Algebra.Lattice.Properties.DistributiveLattice.html
index e7f0a7b..de578b2 100644
--- a/Algebra.Lattice.Properties.DistributiveLattice.html
+++ b/Algebra.Lattice.Properties.DistributiveLattice.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Properties.DistributiveLatticeSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Properties.DistributiveLatticeSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some derivable properties
diff --git a/Algebra.Lattice.Properties.Lattice.html b/Algebra.Lattice.Properties.Lattice.html
index c2e0820..5dd6358 100644
--- a/Algebra.Lattice.Properties.Lattice.html
+++ b/Algebra.Lattice.Properties.Lattice.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Properties.LatticeSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Properties.LatticeSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some derivable properties of lattices
diff --git a/Algebra.Lattice.Properties.Semilattice.html b/Algebra.Lattice.Properties.Semilattice.html
index 7f52aa6..7d747c0 100644
--- a/Algebra.Lattice.Properties.Semilattice.html
+++ b/Algebra.Lattice.Properties.Semilattice.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Properties.SemilatticeSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Properties.SemilatticeSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some derivable properties of semilattices
diff --git a/Algebra.Lattice.Structures.Biased.html b/Algebra.Lattice.Structures.Biased.html
index e873799..4bef223 100644
--- a/Algebra.Lattice.Structures.Biased.html
+++ b/Algebra.Lattice.Structures.Biased.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.Structures.BiasedSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.Structures.BiasedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some biased records for lattice-like structures. Such records are
diff --git a/Algebra.Lattice.Structures.html b/Algebra.Lattice.Structures.html
index d603335..3878500 100644
--- a/Algebra.Lattice.Structures.html
+++ b/Algebra.Lattice.Structures.html
@@ -1,5 +1,5 @@
 
-Algebra.Lattice.StructuresSource code on Github
------------------------------------------------------------------------
+Algebra.Lattice.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some lattice-like structures defined by properties of _∧_ and _∨_
diff --git a/Algebra.Lattice.html b/Algebra.Lattice.html
index ed0e5b7..2c4a0f2 100644
--- a/Algebra.Lattice.html
+++ b/Algebra.Lattice.html
@@ -1,5 +1,5 @@
 
-Algebra.LatticeSource code on Github
------------------------------------------------------------------------
+Algebra.LatticeSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions of algebraic structures like semilattices and lattices
diff --git a/Algebra.Morphism.Definitions.html b/Algebra.Morphism.Definitions.html
index 8cc4100..0c12dca 100644
--- a/Algebra.Morphism.Definitions.html
+++ b/Algebra.Morphism.Definitions.html
@@ -1,5 +1,5 @@
 
-Algebra.Morphism.DefinitionsSource code on Github
------------------------------------------------------------------------
+Algebra.Morphism.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Basic definitions for morphisms between algebraic structures
diff --git a/Algebra.Morphism.GroupMonomorphism.html b/Algebra.Morphism.GroupMonomorphism.html
index 67ec315..08c3295 100644
--- a/Algebra.Morphism.GroupMonomorphism.html
+++ b/Algebra.Morphism.GroupMonomorphism.html
@@ -1,5 +1,5 @@
 
-Algebra.Morphism.GroupMonomorphismSource code on Github
------------------------------------------------------------------------
+Algebra.Morphism.GroupMonomorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Consequences of a monomorphism between group-like structures
diff --git a/Algebra.Morphism.MagmaMonomorphism.html b/Algebra.Morphism.MagmaMonomorphism.html
index 00c1699..91368d8 100644
--- a/Algebra.Morphism.MagmaMonomorphism.html
+++ b/Algebra.Morphism.MagmaMonomorphism.html
@@ -1,5 +1,5 @@
 
-Algebra.Morphism.MagmaMonomorphismSource code on Github
------------------------------------------------------------------------
+Algebra.Morphism.MagmaMonomorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Consequences of a monomorphism between magma-like structures
diff --git a/Algebra.Morphism.MonoidMonomorphism.html b/Algebra.Morphism.MonoidMonomorphism.html
index 77a6291..1775b07 100644
--- a/Algebra.Morphism.MonoidMonomorphism.html
+++ b/Algebra.Morphism.MonoidMonomorphism.html
@@ -1,5 +1,5 @@
 
-Algebra.Morphism.MonoidMonomorphismSource code on Github
------------------------------------------------------------------------
+Algebra.Morphism.MonoidMonomorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Consequences of a monomorphism between monoid-like structures
diff --git a/Algebra.Morphism.RingMonomorphism.html b/Algebra.Morphism.RingMonomorphism.html
index 1e471bf..019de62 100644
--- a/Algebra.Morphism.RingMonomorphism.html
+++ b/Algebra.Morphism.RingMonomorphism.html
@@ -1,5 +1,5 @@
 
-Algebra.Morphism.RingMonomorphismSource code on Github
------------------------------------------------------------------------
+Algebra.Morphism.RingMonomorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Consequences of a monomorphism between ring-like structures
diff --git a/Algebra.Morphism.Structures.html b/Algebra.Morphism.Structures.html
index ed73895..84ad04c 100644
--- a/Algebra.Morphism.Structures.html
+++ b/Algebra.Morphism.Structures.html
@@ -1,5 +1,5 @@
 
-Algebra.Morphism.StructuresSource code on Github
------------------------------------------------------------------------
+Algebra.Morphism.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Morphisms between algebraic structures
diff --git a/Algebra.Morphism.html b/Algebra.Morphism.html
index c860c3d..79dcd11 100644
--- a/Algebra.Morphism.html
+++ b/Algebra.Morphism.html
@@ -1,5 +1,5 @@
 
-Algebra.MorphismSource code on Github
------------------------------------------------------------------------
+Algebra.MorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Morphisms between algebraic structures
diff --git a/Algebra.Properties.AbelianGroup.html b/Algebra.Properties.AbelianGroup.html
index 79eb84d..de75781 100644
--- a/Algebra.Properties.AbelianGroup.html
+++ b/Algebra.Properties.AbelianGroup.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.AbelianGroupSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.AbelianGroupSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some derivable properties
diff --git a/Algebra.Properties.CommutativeSemigroup.html b/Algebra.Properties.CommutativeSemigroup.html
index 2b6eee3..f79f93b 100644
--- a/Algebra.Properties.CommutativeSemigroup.html
+++ b/Algebra.Properties.CommutativeSemigroup.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.CommutativeSemigroupSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.CommutativeSemigroupSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some theory for commutative semigroup
diff --git a/Algebra.Properties.Group.html b/Algebra.Properties.Group.html
index 34e6c05..b4d380d 100644
--- a/Algebra.Properties.Group.html
+++ b/Algebra.Properties.Group.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.GroupSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.GroupSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some derivable properties
diff --git a/Algebra.Properties.Loop.html b/Algebra.Properties.Loop.html
index 256d9e7..9f00ea8 100644
--- a/Algebra.Properties.Loop.html
+++ b/Algebra.Properties.Loop.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.LoopSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.LoopSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some basic properties of Loop
diff --git a/Algebra.Properties.Monoid.Mult.html b/Algebra.Properties.Monoid.Mult.html
index 6baa05d..ab2f3f2 100644
--- a/Algebra.Properties.Monoid.Mult.html
+++ b/Algebra.Properties.Monoid.Mult.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.Monoid.MultSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.Monoid.MultSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Multiplication over a monoid (i.e. repeated addition)
diff --git a/Algebra.Properties.Quasigroup.html b/Algebra.Properties.Quasigroup.html
index d130a9b..6ee306e 100644
--- a/Algebra.Properties.Quasigroup.html
+++ b/Algebra.Properties.Quasigroup.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.QuasigroupSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.QuasigroupSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some basic properties of Quasigroup
diff --git a/Algebra.Properties.Ring.html b/Algebra.Properties.Ring.html
index 3e463b0..b6f643a 100644
--- a/Algebra.Properties.Ring.html
+++ b/Algebra.Properties.Ring.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.RingSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.RingSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some basic properties of Rings
diff --git a/Algebra.Properties.RingWithoutOne.html b/Algebra.Properties.RingWithoutOne.html
index 2a63b80..3901392 100644
--- a/Algebra.Properties.RingWithoutOne.html
+++ b/Algebra.Properties.RingWithoutOne.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.RingWithoutOneSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.RingWithoutOneSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some basic properties of RingWithoutOne
diff --git a/Algebra.Properties.Semigroup.html b/Algebra.Properties.Semigroup.html
index 7c3d12d..8d491e0 100644
--- a/Algebra.Properties.Semigroup.html
+++ b/Algebra.Properties.Semigroup.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.SemigroupSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.SemigroupSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some theory for Semigroup
diff --git a/Algebra.Properties.Semiring.Exp.html b/Algebra.Properties.Semiring.Exp.html
index e9266a7..977bb10 100644
--- a/Algebra.Properties.Semiring.Exp.html
+++ b/Algebra.Properties.Semiring.Exp.html
@@ -1,5 +1,5 @@
 
-Algebra.Properties.Semiring.ExpSource code on Github
------------------------------------------------------------------------
+Algebra.Properties.Semiring.ExpSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Exponentiation defined over a semiring as repeated multiplication
diff --git a/Algebra.Solver.Ring.AlmostCommutativeRing.html b/Algebra.Solver.Ring.AlmostCommutativeRing.html
index c23366c..d05a3c0 100644
--- a/Algebra.Solver.Ring.AlmostCommutativeRing.html
+++ b/Algebra.Solver.Ring.AlmostCommutativeRing.html
@@ -1,5 +1,5 @@
 
-Algebra.Solver.Ring.AlmostCommutativeRingSource code on Github
------------------------------------------------------------------------
+Algebra.Solver.Ring.AlmostCommutativeRingSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Commutative semirings with some additional structure ("almost"
diff --git a/Algebra.Solver.Ring.Lemmas.html b/Algebra.Solver.Ring.Lemmas.html
index 963a967..c303cf2 100644
--- a/Algebra.Solver.Ring.Lemmas.html
+++ b/Algebra.Solver.Ring.Lemmas.html
@@ -1,5 +1,5 @@
 
-Algebra.Solver.Ring.LemmasSource code on Github
------------------------------------------------------------------------
+Algebra.Solver.Ring.LemmasSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some boring lemmas used by the ring solver
diff --git a/Algebra.Solver.Ring.Simple.html b/Algebra.Solver.Ring.Simple.html
index 34ca7b6..3827c7f 100644
--- a/Algebra.Solver.Ring.Simple.html
+++ b/Algebra.Solver.Ring.Simple.html
@@ -1,5 +1,5 @@
 
-Algebra.Solver.Ring.SimpleSource code on Github
------------------------------------------------------------------------
+Algebra.Solver.Ring.SimpleSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Instantiates the ring solver with two copies of the same ring with
diff --git a/Algebra.Solver.Ring.html b/Algebra.Solver.Ring.html
index b2050bc..3cc86ac 100644
--- a/Algebra.Solver.Ring.html
+++ b/Algebra.Solver.Ring.html
@@ -1,5 +1,5 @@
 
-Algebra.Solver.RingSource code on Github
------------------------------------------------------------------------
+Algebra.Solver.RingSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Old solver for commutative ring or semiring equalities
diff --git a/Algebra.Structures.Biased.html b/Algebra.Structures.Biased.html
index c67e4e7..5845dfa 100644
--- a/Algebra.Structures.Biased.html
+++ b/Algebra.Structures.Biased.html
@@ -1,5 +1,5 @@
 
-Algebra.Structures.BiasedSource code on Github
------------------------------------------------------------------------
+Algebra.Structures.BiasedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Ways to give instances of certain structures where some fields can
diff --git a/Algebra.Structures.html b/Algebra.Structures.html
index 9f17153..9397866 100644
--- a/Algebra.Structures.html
+++ b/Algebra.Structures.html
@@ -1,5 +1,5 @@
 
-Algebra.StructuresSource code on Github
------------------------------------------------------------------------
+Algebra.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some algebraic structures (not packed up with sets, operations, etc.)
diff --git a/Algebra.html b/Algebra.html
index a5a1d86..4a8c418 100644
--- a/Algebra.html
+++ b/Algebra.html
@@ -1,5 +1,5 @@
 
-AlgebraSource code on Github
------------------------------------------------------------------------
+AlgebraSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions of algebraic structures like monoids and rings
diff --git a/Axiom.Extensionality.Propositional.html b/Axiom.Extensionality.Propositional.html
index 7120eda..731808a 100644
--- a/Axiom.Extensionality.Propositional.html
+++ b/Axiom.Extensionality.Propositional.html
@@ -1,5 +1,5 @@
 
-Axiom.Extensionality.PropositionalSource code on Github
------------------------------------------------------------------------
+Axiom.Extensionality.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Results concerning function extensionality for propositional equality
diff --git a/Axiom.UniquenessOfIdentityProofs.html b/Axiom.UniquenessOfIdentityProofs.html
index a7ba911..2eb7a80 100644
--- a/Axiom.UniquenessOfIdentityProofs.html
+++ b/Axiom.UniquenessOfIdentityProofs.html
@@ -1,5 +1,5 @@
 
-Axiom.UniquenessOfIdentityProofsSource code on Github
------------------------------------------------------------------------
+Axiom.UniquenessOfIdentityProofsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Results concerning uniqueness of identity proofs
diff --git a/Class.Applicative.Core.html b/Class.Applicative.Core.html
index ba82dfb..0f6df0b 100644
--- a/Class.Applicative.Core.html
+++ b/Class.Applicative.Core.html
@@ -1,5 +1,5 @@
 
-Class.Applicative.CoreSource code on Github
{-# OPTIONS --without-K #-}
+Class.Applicative.CoreSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Applicative.Core where
 
 open import Class.Prelude
diff --git a/Class.Applicative.Instances.html b/Class.Applicative.Instances.html
index fa6839d..0d477f7 100644
--- a/Class.Applicative.Instances.html
+++ b/Class.Applicative.Instances.html
@@ -1,5 +1,5 @@
 
-Class.Applicative.InstancesSource code on Github
{-# OPTIONS --without-K #-}
+Class.Applicative.InstancesSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Applicative.Instances where
 
 open import Class.Prelude
diff --git a/Class.Applicative.html b/Class.Applicative.html
index 5bd126e..f095964 100644
--- a/Class.Applicative.html
+++ b/Class.Applicative.html
@@ -1,5 +1,5 @@
 
-Class.ApplicativeSource code on Github
{-# OPTIONS --without-K #-}
+Class.ApplicativeSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Applicative where
 
 open import Class.Applicative.Core public
diff --git a/Class.Core.html b/Class.Core.html
index a846c53..8bc9392 100644
--- a/Class.Core.html
+++ b/Class.Core.html
@@ -1,5 +1,5 @@
 
-Class.CoreSource code on Github
{-# OPTIONS --without-K #-}
+Class.CoreSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Core where
 
 open import Class.Prelude
diff --git a/Class.DecEq.Core.html b/Class.DecEq.Core.html
index e03f9dc..a98e880 100644
--- a/Class.DecEq.Core.html
+++ b/Class.DecEq.Core.html
@@ -1,5 +1,5 @@
 
-Class.DecEq.CoreSource code on Github
{-# OPTIONS --without-K #-}
+Class.DecEq.CoreSource code on Github
{-# OPTIONS --without-K #-}
 module Class.DecEq.Core where
 
 open import Class.Prelude
diff --git a/Class.DecEq.Instances.html b/Class.DecEq.Instances.html
index d3901f5..6f37260 100644
--- a/Class.DecEq.Instances.html
+++ b/Class.DecEq.Instances.html
@@ -1,5 +1,5 @@
 
-Class.DecEq.InstancesSource code on Github
{-# OPTIONS --without-K #-}
+Class.DecEq.InstancesSource code on Github
{-# OPTIONS --without-K #-}
 module Class.DecEq.Instances where
 
 open import Class.Prelude
diff --git a/Class.DecEq.html b/Class.DecEq.html
index c7aacce..9de63e7 100644
--- a/Class.DecEq.html
+++ b/Class.DecEq.html
@@ -1,5 +1,5 @@
 
-Class.DecEqSource code on Github
{-# OPTIONS --without-K #-}
+Class.DecEqSource code on Github
{-# OPTIONS --without-K #-}
 module Class.DecEq where
 
 open import Class.DecEq.Core public
diff --git a/Class.Functor.Core.html b/Class.Functor.Core.html
index 5a697e8..969480e 100644
--- a/Class.Functor.Core.html
+++ b/Class.Functor.Core.html
@@ -1,5 +1,5 @@
 
-Class.Functor.CoreSource code on Github
{-# OPTIONS --without-K #-}
+Class.Functor.CoreSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Functor.Core where
 
 open import Class.Prelude
diff --git a/Class.Functor.Instances.html b/Class.Functor.Instances.html
index 51a3b27..769949b 100644
--- a/Class.Functor.Instances.html
+++ b/Class.Functor.Instances.html
@@ -1,5 +1,5 @@
 
-Class.Functor.InstancesSource code on Github
{-# OPTIONS --without-K #-}
+Class.Functor.InstancesSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Functor.Instances where
 
 open import Class.Prelude
diff --git a/Class.Functor.html b/Class.Functor.html
index 535d9de..6cf425d 100644
--- a/Class.Functor.html
+++ b/Class.Functor.html
@@ -1,5 +1,5 @@
 
-Class.FunctorSource code on Github
{-# OPTIONS --without-K #-}
+Class.FunctorSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Functor where
 
 open import Class.Functor.Core public
diff --git a/Class.Monad.Core.html b/Class.Monad.Core.html
index a3a105f..cc1dea7 100644
--- a/Class.Monad.Core.html
+++ b/Class.Monad.Core.html
@@ -1,5 +1,5 @@
 
-Class.Monad.CoreSource code on Github
{-# OPTIONS --without-K #-}
+Class.Monad.CoreSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Monad.Core where
 
 open import Class.Prelude
diff --git a/Class.Monad.Instances.html b/Class.Monad.Instances.html
index 6f041f0..904617a 100644
--- a/Class.Monad.Instances.html
+++ b/Class.Monad.Instances.html
@@ -1,5 +1,5 @@
 
-Class.Monad.InstancesSource code on Github
{-# OPTIONS --without-K #-}
+Class.Monad.InstancesSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Monad.Instances where
 
 open import Class.Prelude
diff --git a/Class.Monad.html b/Class.Monad.html
index 133474c..1d330bc 100644
--- a/Class.Monad.html
+++ b/Class.Monad.html
@@ -1,5 +1,5 @@
 
-Class.MonadSource code on Github
{-# OPTIONS --without-K #-}
+Class.MonadSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Monad where
 
 open import Class.Monad.Core public
diff --git a/Class.MonadError.Instances.html b/Class.MonadError.Instances.html
index 0037323..e886cb9 100644
--- a/Class.MonadError.Instances.html
+++ b/Class.MonadError.Instances.html
@@ -1,5 +1,5 @@
 
-Class.MonadError.InstancesSource code on Github
{-# OPTIONS --safe --without-K #-}
+Class.MonadError.InstancesSource code on Github
{-# OPTIONS --safe --without-K #-}
 module Class.MonadError.Instances where
 
 open import Class.MonadError public
diff --git a/Class.MonadError.html b/Class.MonadError.html
index c17294a..d0900b5 100644
--- a/Class.MonadError.html
+++ b/Class.MonadError.html
@@ -1,5 +1,5 @@
 
-Class.MonadErrorSource code on Github
{-# OPTIONS --safe --without-K #-}
+Class.MonadErrorSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 open import Level
 
diff --git a/Class.MonadReader.Instances.html b/Class.MonadReader.Instances.html
index 493958b..1761210 100644
--- a/Class.MonadReader.Instances.html
+++ b/Class.MonadReader.Instances.html
@@ -1,5 +1,5 @@
 
-Class.MonadReader.InstancesSource code on Github
{-# OPTIONS --safe --without-K #-}
+Class.MonadReader.InstancesSource code on Github
{-# OPTIONS --safe --without-K #-}
 module Class.MonadReader.Instances where
 
 open import Class.MonadReader public
diff --git a/Class.MonadReader.html b/Class.MonadReader.html
index 9e16505..d5c77dc 100644
--- a/Class.MonadReader.html
+++ b/Class.MonadReader.html
@@ -1,5 +1,5 @@
 
-Class.MonadReaderSource code on Github
{-# OPTIONS --safe --without-K #-}
+Class.MonadReaderSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 module Class.MonadReader where
 
diff --git a/Class.MonadTC.Instances.html b/Class.MonadTC.Instances.html
index 3bd6221..8bf8de5 100644
--- a/Class.MonadTC.Instances.html
+++ b/Class.MonadTC.Instances.html
@@ -1,7 +1,7 @@
 
-Class.MonadTC.InstancesSource code on Github
{-# OPTIONS --safe --without-K #-}
+Class.MonadTC.InstancesSource code on Github
{-# OPTIONS --safe --without-K #-}
 module Class.MonadTC.Instances where
 
 open import Class.MonadTC public
-open MonadTC ⦃...⦄ public
+open MonadTC ⦃...⦄ public
 

\ No newline at end of file
diff --git a/Class.MonadTC.html b/Class.MonadTC.html
index da525de..33b8b39 100644
--- a/Class.MonadTC.html
+++ b/Class.MonadTC.html
@@ -1,5 +1,5 @@
 
-Class.MonadTCSource code on Github
{-# OPTIONS --safe --without-K #-}
+Class.MonadTCSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 module Class.MonadTC where
 
@@ -13,357 +13,428 @@
 
 open import Reflection.Debug
 
-open import Class.MonadReader
-open import Class.MonadError
-open import Class.Functor
-open import Class.Monad
-open import Class.Traversable
-
-private variable
-  a f : Level
-  A B : Set f
-
-data ReductionOptions : Set where
-  onlyReduce : List Name → ReductionOptions
-  dontReduce : List Name → ReductionOptions
-
-reduceAll : ReductionOptions
-reduceAll = dontReduce []
-
-record TCOptions : Set where
-  field
-    debug : DebugOptions
-    fuel  : List (String × ℕ)
-
-defaultTCOptions : TCOptions
-defaultTCOptions = record
-  { debug = defaultDebugOptions
-  ; fuel  = [] }
-
-record TCEnv : Set where
-  field
-    normalisation  : Bool
-    reconstruction : Bool
-    noConstraints  : Bool
-    reduction      : ReductionOptions
-    globalContext  : Telescope
-    localContext   : Telescope
-    goal           : Term ⊎ Type
-    options        : TCOptions
-
-  open TCOptions options public
-
-initTCEnvWithGoal : Term → R.TC TCEnv
-initTCEnvWithGoal goal = R.getContext <&> λ ctx → record
-  { normalisation  = false
-  ; reconstruction = false
-  ; noConstraints  = false
-  ; reduction      = reduceAll
-  ; globalContext  = ctx
-  ; localContext   = []
-  ; goal           = inj₁ goal
-  ; options        = defaultTCOptions
-  }
-
-initTCEnv : R.TC TCEnv
-initTCEnv = initTCEnvWithGoal unknown
-
-record MonadTC (M : ∀ {f} → Set f → Set f)
-               ⦃ m : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ : Setω₁ where
-  field
-    unify            : Term → Term → M ⊤
-    typeError        : ∀ {A : Set f} → List ErrorPart → M A
-    inferType        : Term → M Type
-    checkType        : Term → Type → M Term
-    normalise        : Term → M Term
-    reduce           : Term → M Term
-    quoteTC          : A → M Term
-    unquoteTC        : Term → M A
-    quoteωTC         : ∀ {A : Setω} → A → M Term
-    freshName        : String → M Name
-    declareDef       : Arg Name → Type → M ⊤
-    declarePostulate : Arg Name → Type → M ⊤
-    defineFun        : Name → List Clause → M ⊤
-    getType          : Name → M Type
-    getDefinition    : Name → M Definition
-    blockOnMeta      : Meta → M A
-    commitTC         : M ⊤
-    isMacro          : Name → M Bool
-    debugPrint       : String → ℕ → List ErrorPart → M ⊤
-    runSpeculative   : M (A × Bool) → M A
-    getInstances     : Meta → M (List Term)
-
-  instance _ = Functor-M {M = M}
-  open MonadError me
-
-  runAndReset : M A → M A
-  runAndReset x = runSpeculative ((_, false) <$> x)
-
-  -- dry-run and return true iff no error occured
-  -- does not change any state
-  isSuccessful : M A → M Bool
-  isSuccessful x = runAndReset (catch (x >> return true) (λ _ → return false))
-
-  -- TODO: return true on function, axiom and prim-fun constructors?
-  isDef : Name → M Bool
-  isDef n = do
-    constructor′ _ _ ← getDefinition n
-      where _ → return true
-    return false
-
-  isCon : Name → M Bool
-  isCon n = do
-    constructor′ _ _ ← getDefinition n
-      where _ → return false
-    return true
-
-  nameConstr : Name → List (Arg Term) → M Term
-  nameConstr n args = do
-    isD ← isDef n
-    isC ← isCon n
-    case (isD , isC) of λ where
-      (true , _)      → return $ def n args
-      (false , true)  → return $ con n args
-      (false , false) → error ((R'.primShowQName n <+> "is neither a definition nor a constructor!") ∷ᵈ [])
-
-  termFromName : Name → M Term
-  termFromName n = nameConstr n []
-
-  -- apply the unique constructor of the record to the arguments
-  mkRecord : Name → List (Arg Term) → M Term
-  mkRecord n args = do
-    (record′ c _) ← getDefinition n
-      where _ → error ("Not a record!" ∷ᵈ [])
-    return $ con c args
-
-  -- this allows mutual recursion
-  declareAndDefineFuns : List (Arg Name × Type × List Clause) → M ⊤
-  declareAndDefineFuns ds = do
-    traverse (λ (n , t , _) → declareDef n t) ds
-    traverse (λ where (arg _ n , _ , cs) → defineFun n cs) ds
-    return _
-
-  declareAndDefineFun : Arg Name → Type → List Clause → M ⊤
-  declareAndDefineFun n ty cls = declareAndDefineFuns [ (n , ty , cls) ]
-
-  newMeta : Term → M Term
-  newMeta = checkType unknown
-
-module _ {M : ∀ {f} → Set f → Set f}
-  ⦃ m : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mtc : MonadTC M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ where
-
-  instance _ = Functor-M {M = M}
-  open MonadError me
-  open MonadTC mtc
-  open MonadReader mre
-
-  record IsMErrorPart (A : Set a) : Setω where
-    field toMErrorPart : A → M (List ErrorPart)
-
-  open IsMErrorPart ⦃...⦄ public
-
-  data MErrorPartWrap : Set where
-    wrap : M (List ErrorPart) → MErrorPartWrap
-
-  IsMErrorPart-IsErrorPart : ⦃ _ : IsErrorPart A ⦄ → IsMErrorPart A
-  IsMErrorPart-IsErrorPart .toMErrorPart a = return [ toErrorPart a ]
-
-  instance
-    IsMErrorPart-String : IsMErrorPart String
-    IsMErrorPart-String = IsMErrorPart-IsErrorPart
-
-    IsMErrorPart-Term : IsMErrorPart Term
-    IsMErrorPart-Term = IsMErrorPart-IsErrorPart
-
-    IsMErrorPart-Name : IsMErrorPart Name
-    IsMErrorPart-Name = IsMErrorPart-IsErrorPart
-
-    IsMErrorPart-MErrorPartWrap : IsMErrorPart MErrorPartWrap
-    IsMErrorPart-MErrorPartWrap .toMErrorPart (wrap a) = a
-
-  []ᵐ : M (List ErrorPart)
-  []ᵐ = return []
-
-  infixr 5 _∷ᵈᵐ_
-  _∷ᵈᵐ_ : A → ⦃ _ : IsMErrorPart A ⦄ → M (List ErrorPart) → M (List ErrorPart)
-  e ∷ᵈᵐ es = do e ← toMErrorPart e; es ← es; return (e ++ es)
-
-  _ᵛ : A → MErrorPartWrap
-  a ᵛ = wrap do a ← quoteTC a; return (a ∷ᵈ [])
-
-  _ᵛⁿ : A → MErrorPartWrap
-  a ᵛⁿ = wrap do a ← local (λ env → record env { normalisation = true }) $ quoteTC a; return (a ∷ᵈ [])
-
-  _ᵗ : Term → MErrorPartWrap
-  t ᵗ = wrap do T ← inferType t; return (t ∷ᵈ " : " ∷ᵈ T ∷ᵈ [])
-
-  debugLog : List ErrorPart → M ⊤
-  debugLog es = do
-    record { options = record { debug = debug } } ← ask
-    if debug .DebugOptions.filter (debug .DebugOptions.path)
-      then debugPrint (debugOptionsPath debug) (debug .DebugOptions.level)
-             (debugPrintPrefix debug ∷ es)
-      else return tt
-
-  debugLogᵐ : M (List ErrorPart) → M ⊤
-  debugLogᵐ x = do x ← x; debugLog x
-
-  debugLog1ᵐ : A → ⦃ _ : IsMErrorPart A ⦄ → M ⊤
-  debugLog1ᵐ a = debugLogᵐ (a ∷ᵈᵐ []ᵐ)
-
-  -- withDebugOptions : DebugOptions → M A → M A
-  -- withDebugOptions opts x = local (λ where
-  --   env@record { debug = opts' } → record env { debug = specializeDebugOptions opts' opts }) x
-
-  withAppendDebugPath : String → M A → M A
-  withAppendDebugPath path x = local (λ where
-    env@record { options = o@record { debug = opts } } → record env {
-      options = record o { debug = record opts { path = opts .DebugOptions.path ∷ʳ path } } }) x
-
-  noConstraints : M A → M A
-  noConstraints = local λ e → record e { noConstraints = true }
-
-  hasType : Term → Type → M Bool
-  hasType t ty = isSuccessful (noConstraints $ checkType t ty)
-
-  hasType' : Name → Type → M Bool
-  hasType' n ty = isSuccessful $ noConstraints $ do
-    t ← termFromName n
-    t' ← checkType t ty
-    if isAppliedToUnknownsAndMetas t'
-      then return tt
-      else error ("This makes the function return false" ∷ᵈ [])
-    where
-      isUnknownsAndMetas : List (Arg Term) → Bool
-      isUnknownsAndMetas [] = true
-      isUnknownsAndMetas (arg i (meta x x₁) ∷ l) = isUnknownsAndMetas l
-      isUnknownsAndMetas (arg i unknown ∷ l) = isUnknownsAndMetas l
-      isUnknownsAndMetas (arg i _ ∷ l) = false
-
-      isAppliedToUnknownsAndMetas : Term → Bool
-      isAppliedToUnknownsAndMetas (var x args)      = isUnknownsAndMetas args
-      isAppliedToUnknownsAndMetas (con c args)      = isUnknownsAndMetas args
-      isAppliedToUnknownsAndMetas (def f args)      = isUnknownsAndMetas args
-      isAppliedToUnknownsAndMetas (pat-lam cs args) = isUnknownsAndMetas args
-      isAppliedToUnknownsAndMetas (meta x args)     = isUnknownsAndMetas args
-      isAppliedToUnknownsAndMetas _                 = true
-
-  extendContext : String × Arg Type → M A → M A
-  extendContext ty = local λ where e@record { localContext = Γ } → record e { localContext = ty ∷ Γ }
-
-  getContext : M Telescope
-  getContext = reader λ where
-    e@record { localContext = Γ ; globalContext = Γ' } → Γ Data.List.++ Γ'
-
-  getLocalContext : M Telescope
-  getLocalContext = reader λ where e@record { localContext = Γ } → Γ
-
-  inContext : Telescope → M A → M A
-  inContext ctx = local λ e → record e { localContext = ctx }
-
-  -- extend context by multiple variables
-  extendContext' : Telescope → M A → M A
-  extendContext' [] x = x
-  extendContext' (c ∷ cs) x = extendContext c (extendContext' cs x)
-
-  dropContext : ℕ → M A → M A
-  dropContext n x = do
-    ctx ← getContext
-    inContext (drop n ctx) x
-
-  logAndError : List ErrorPart → M A
-  logAndError e = debugLog e >> error e
-
-  error1 : ⦃ IsErrorPart A ⦄ → A → M B
-  error1 a = error (a ∷ᵈ [])
-
-  debugLog1 : ⦃ IsErrorPart A ⦄ → A → M ⊤
-  debugLog1 a = debugLog (a ∷ᵈ [])
-
-  logAndError1 : ⦃ IsErrorPart A ⦄ → A → M B
-  logAndError1 a = debugLog1 a >> error1 a
-
-  markDontFail : String → M A → M A
-  markDontFail s x = catch x λ e → logAndError (s ∷ᵈ " should never fail! This is a bug!\nError:\n" ∷ᵈ e)
-
-  goalTy : M Type
-  goalTy = do
-    inj₁ t ← reader TCEnv.goal
-      where inj₂ T → return T
-    inferType t
-
-  -- take the first result if it's a just, otherwise reset the state and
-  -- run the second computation
-  runSpeculativeMaybe : M (Maybe A) → M A → M A
-  runSpeculativeMaybe x y = do
-    nothing ← runSpeculative (< id , is-just > <$> x)
-      where just a → return a
-    y
-
-  try : List (M ⊤) → M ⊤ → M ⊤
-  try [] e = e
-  try (x ∷ cs) e = MonadError.catch me x (λ _ → try cs e)
-
-  getConstrs : Name → M (List (Name × Type))
-  getConstrs n = do
-    d ← getDefinition n
-    cs ← case d of λ where
-      (record′ c fs)  → return [ c ]
-      (data-type pars cs) → return cs
-      _                   → error (n ∷ᵈ "is not a data or record definition!" ∷ᵈ [])
-    traverse (λ n → (n ,_) <$> (normalise =<< getType n)) (List Name ∋ cs)
-
-  getConstrsForType : Term → M (List (Name × Type))
-  getConstrsForType ty = do
-    (def n _) ← normalise ty
-      where _ → error (ty ∷ᵈ "does not reduce to a definition!" ∷ᵈ [])
-    getConstrs n
-
-  getConstrsForTerm : Term → M (List (Name × Type))
-  getConstrsForTerm t = getConstrsForType =<< inferType t
-
-  -- run a TC computation to arrive at the term under the binder for the pattern
-  withPattern : Telescope → List (Arg Pattern) → M Term → M Clause
-  withPattern tel ps t = Clause.clause tel ps <$> extendContext' tel t
-
-  unifyWithGoal : Term → M ⊤
-  unifyWithGoal t = do
-    inj₁ t' ← reader TCEnv.goal
-      where _ → error1 "unifyWithGoal: Goal is not a term!"
-    unify t' t
-
-  runWithHole : Term → M A → M A
-  runWithHole t = local (λ env → record env { goal = inj₁ t })
-
-  runWithGoalTy : Term → M A → M A
-  runWithGoalTy t = local (λ env → record env { goal = inj₂ t })
-
-  goalHole : M Term
-  goalHole = do
-    inj₂ T ← reader TCEnv.goal
-      where inj₁ hole → return hole
-    newMeta T
-
-  withGoalHole : M ⊤ → M Term
-  withGoalHole tac = do
-    hole ← goalHole
-    runWithHole hole tac
-    return hole
-
-  -- Finding all instance candidates of a given type.
-  findInstances : Type → M (List Term)
-  findInstances ty = runAndReset $ do
-    just m ← findMeta <$> newMeta ty
-      where _ → error1 "[findInstances] newMeta did not produce meta-variable!"
-    getInstances m
-    where
-      open import Data.Maybe using (_<∣>_)
-      findMeta = λ where
-        (pi (arg _ ty) (abs _ t)) → findMeta ty <∣> findMeta t
-        (lam _ (abs _ t))         → findMeta t
-        (meta m _)                → just m
-        _                         → nothing
-
-MonadTC-TC : MonadTC R.TC ⦃ Monad-TC ⦄ ⦃ MonadError-TC ⦄
-MonadTC-TC = record { R; R' using (quoteωTC; withReconstructed; onlyReduceDefs; dontReduceDefs; getInstances) }
+open import Class.Show
+open import Class.DecEq
+open import Class.MonadReader
+open import Class.MonadError
+open import Class.Functor
+open import Class.Monad
+open import Class.Traversable
+
+private variable
+  a f : Level
+  A B : Set f
+
+data ReductionOptions : Set where
+  onlyReduce : List Name → ReductionOptions
+  dontReduce : List Name → ReductionOptions
+
+reduceAll : ReductionOptions
+reduceAll = dontReduce []
+
+record TCOptions : Set where
+  field
+    debug : DebugOptions
+    fuel  : List (String × ℕ)
+
+defaultTCOptions : TCOptions
+defaultTCOptions = record
+  { debug = defaultDebugOptions
+  ; fuel  = [] }
+
+record TCEnv : Set where
+  field
+    normalisation  : Bool
+    reconstruction : Bool
+    noConstraints  : Bool
+    reduction      : ReductionOptions
+    globalContext  : Telescope
+    localContext   : Telescope
+    goal           : Term ⊎ Type
+    options        : TCOptions
+
+  open TCOptions options public
+
+initTCEnvWithGoal : Term → R.TC TCEnv
+initTCEnvWithGoal goal = R.getContext <&> λ ctx → record
+  { normalisation  = false
+  ; reconstruction = false
+  ; noConstraints  = false
+  ; reduction      = reduceAll
+  ; globalContext  = ctx
+  ; localContext   = []
+  ; goal           = inj₁ goal
+  ; options        = defaultTCOptions
+  }
+
+initTCEnv : R.TC TCEnv
+initTCEnv = initTCEnvWithGoal unknown
+
+record MonadTC (M : ∀ {f} → Set f → Set f)
+               ⦃ m : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ : Setω₁ where
+  field
+    unify            : Term → Term → M ⊤
+    typeError        : ∀ {A : Set f} → List ErrorPart → M A
+    inferType        : Term → M Type
+    checkType        : Term → Type → M Term
+    normalise        : Term → M Term
+    reduce           : Term → M Term
+    quoteTC          : A → M Term
+    unquoteTC        : Term → M A
+    quoteωTC         : ∀ {A : Setω} → A → M Term
+    freshName        : String → M Name
+    declareDef       : Arg Name → Type → M ⊤
+    declarePostulate : Arg Name → Type → M ⊤
+    defineFun        : Name → List Clause → M ⊤
+    getType          : Name → M Type
+    getDefinition    : Name → M Definition
+    blockOnMeta      : Meta → M A
+    commitTC         : M ⊤
+    isMacro          : Name → M Bool
+    debugPrint       : String → ℕ → List ErrorPart → M ⊤
+    runSpeculative   : M (A × Bool) → M A
+    getInstances     : Meta → M (List Term)
+
+  instance _ = Functor-M {M = M}
+  open MonadError me
+
+  runAndReset : M A → M A
+  runAndReset x = runSpeculative ((_, false) <$> x)
+
+  -- dry-run and return true iff no error occured
+  -- does not change any state
+  isSuccessful : M A → M Bool
+  isSuccessful x = runAndReset (catch (x >> return true) (λ _ → return false))
+
+  -- TODO: return true on function, axiom and prim-fun constructors?
+  isDef : Name → M Bool
+  isDef n = do
+    constructor′ _ _ ← getDefinition n
+      where _ → return true
+    return false
+
+  isCon : Name → M Bool
+  isCon n = do
+    constructor′ _ _ ← getDefinition n
+      where _ → return false
+    return true
+
+  nameConstr : Name → List (Arg Term) → M Term
+  nameConstr n args = do
+    isD ← isDef n
+    isC ← isCon n
+    case (isD , isC) of λ where
+      (true , _)      → return $ def n args
+      (false , true)  → return $ con n args
+      (false , false) → error ((R'.primShowQName n <+> "is neither a definition nor a constructor!") ∷ᵈ [])
+
+  termFromName : Name → M Term
+  termFromName n = nameConstr n []
+
+  -- apply the unique constructor of the record to the arguments
+  mkRecord : Name → List (Arg Term) → M Term
+  mkRecord n args = do
+    (record′ c _) ← getDefinition n
+      where _ → error ("Not a record!" ∷ᵈ [])
+    return $ con c args
+
+  isSolvedMeta : Term → M Bool
+  isSolvedMeta m@(meta x args) = do
+    r@(meta y _) ← reduce m
+      where _ → return true
+    return (x ≠ y)
+  isSolvedMeta _ = error ("Not a meta!" ∷ᵈ [])
+
+  hasUnsolvedMetas : Term → M Bool
+  hasUnsolvedMetas' : List (Arg Term) → M Bool
+  hasUnsolvedMetasCl : List Clause → M Bool
+  hasUnsolvedMetasTel : Telescope → M Bool
+
+  hasUnsolvedMetas (var x args) = hasUnsolvedMetas' args
+  hasUnsolvedMetas (con c args) = hasUnsolvedMetas' args
+  hasUnsolvedMetas (def f args) = hasUnsolvedMetas' args
+  hasUnsolvedMetas (lam v (abs _ t)) = hasUnsolvedMetas t
+  hasUnsolvedMetas (pat-lam cs args) = do
+    a ← hasUnsolvedMetasCl cs
+    b ← hasUnsolvedMetas' args
+    return (a ∨ b)
+  hasUnsolvedMetas (pi (arg _ a) (abs _ b)) = do
+    a ← hasUnsolvedMetas a
+    b ← hasUnsolvedMetas b
+    return (a ∨ b)
+  hasUnsolvedMetas (sort (set t)) = hasUnsolvedMetas t
+  hasUnsolvedMetas (sort (prop t)) = hasUnsolvedMetas t
+  hasUnsolvedMetas (sort unknown) = return true
+  hasUnsolvedMetas (sort _) = return false
+  hasUnsolvedMetas (lit l) = return false
+  hasUnsolvedMetas m@(meta x x₁) = not <$> isSolvedMeta m
+  hasUnsolvedMetas unknown = return false
+
+  hasUnsolvedMetas' [] = return false
+  hasUnsolvedMetas' ((arg _ x) ∷ l) = do
+    a ← hasUnsolvedMetas x
+    b ← hasUnsolvedMetas' l
+    return (a ∨ b)
+
+  hasUnsolvedMetasCl [] = return false
+  hasUnsolvedMetasCl (clause tel _ t ∷ cl) = do
+    a ← hasUnsolvedMetas t
+    b ← hasUnsolvedMetasTel tel
+    c ← hasUnsolvedMetasCl cl
+    return (a ∨ b ∨ c)
+  hasUnsolvedMetasCl (absurd-clause tel _ ∷ cl) = do
+    a ← hasUnsolvedMetasTel tel
+    b ← hasUnsolvedMetasCl cl
+    return (a ∨ b)
+
+  hasUnsolvedMetasTel [] = return false
+  hasUnsolvedMetasTel ((_ , arg _ x) ∷ tel) = do
+    a ← hasUnsolvedMetas x
+    b ← hasUnsolvedMetasTel tel
+    return (a ∨ b)
+
+  -- this allows mutual recursion
+  declareAndDefineFuns : List (Arg Name × Type × List Clause) → M ⊤
+  declareAndDefineFuns ds = do
+    traverse (λ (n , t , _) → declareDef n t) ds
+    traverse (λ where (arg _ n , _ , cs) → defineFun n cs) ds
+    return _
+
+  declareAndDefineFunsDebug : List (Arg Name × Type × List Clause) → M ⊤
+  declareAndDefineFunsDebug ds = do
+    traverse (λ (n , t , _) → declareDef n t) ds
+    traverse (λ where (arg _ n , _ , _) → do
+      b ← getType n >>= hasUnsolvedMetas
+      if b then error [ strErr $ show n ] else return tt) ds
+    traverse (λ where (arg _ n , _ , cs) → defineFun n cs) ds
+    traverse (λ where (arg _ n , _ , _) → do
+      d@(function cs) ← getDefinition n
+        where _ → error [ strErr "Weird bug" ]
+      b ← hasUnsolvedMetasCl cs
+      if b then error [ strErr $ show d ] else return tt) ds
+    return _
+
+  declareAndDefineFun : Arg Name → Type → List Clause → M ⊤
+  declareAndDefineFun n ty cls = declareAndDefineFuns [ (n , ty , cls) ]
+
+  newMeta : Term → M Term
+  newMeta = checkType unknown
+
+module _ {M : ∀ {f} → Set f → Set f}
+  ⦃ m : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mtc : MonadTC M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ where
+
+  instance _ = Functor-M {M = M}
+  open MonadError me
+  open MonadTC mtc
+  open MonadReader mre
+
+  record IsMErrorPart (A : Set a) : Setω where
+    field toMErrorPart : A → M (List ErrorPart)
+
+  open IsMErrorPart ⦃...⦄ public
+
+  data MErrorPartWrap : Set where
+    wrap : M (List ErrorPart) → MErrorPartWrap
+
+  IsMErrorPart-IsErrorPart : ⦃ _ : IsErrorPart A ⦄ → IsMErrorPart A
+  IsMErrorPart-IsErrorPart .toMErrorPart a = return [ toErrorPart a ]
+
+  instance
+    IsMErrorPart-String : IsMErrorPart String
+    IsMErrorPart-String = IsMErrorPart-IsErrorPart
+
+    IsMErrorPart-Term : IsMErrorPart Term
+    IsMErrorPart-Term = IsMErrorPart-IsErrorPart
+
+    IsMErrorPart-Name : IsMErrorPart Name
+    IsMErrorPart-Name = IsMErrorPart-IsErrorPart
+
+    IsMErrorPart-MErrorPartWrap : IsMErrorPart MErrorPartWrap
+    IsMErrorPart-MErrorPartWrap .toMErrorPart (wrap a) = a
+
+  []ᵐ : M (List ErrorPart)
+  []ᵐ = return []
+
+  infixr 5 _∷ᵈᵐ_
+  _∷ᵈᵐ_ : A → ⦃ _ : IsMErrorPart A ⦄ → M (List ErrorPart) → M (List ErrorPart)
+  e ∷ᵈᵐ es = do e ← toMErrorPart e; es ← es; return (e ++ es)
+
+  _ᵛ : A → MErrorPartWrap
+  a ᵛ = wrap do a ← quoteTC a; return (a ∷ᵈ [])
+
+  _ᵛⁿ : A → MErrorPartWrap
+  a ᵛⁿ = wrap do a ← local (λ env → record env { normalisation = true }) $ quoteTC a; return (a ∷ᵈ [])
+
+  _ᵗ : Term → MErrorPartWrap
+  t ᵗ = wrap do T ← inferType t; return (t ∷ᵈ " : " ∷ᵈ T ∷ᵈ [])
+
+  debugLog : List ErrorPart → M ⊤
+  debugLog es = do
+    record { options = record { debug = debug } } ← ask
+    if debug .DebugOptions.filter (debug .DebugOptions.path)
+      then debugPrint (debugOptionsPath debug) (debug .DebugOptions.level)
+             (debugPrintPrefix debug ∷ es)
+      else return tt
+
+  debugLogᵐ : M (List ErrorPart) → M ⊤
+  debugLogᵐ x = do x ← x; debugLog x
+
+  debugLog1ᵐ : A → ⦃ _ : IsMErrorPart A ⦄ → M ⊤
+  debugLog1ᵐ a = debugLogᵐ (a ∷ᵈᵐ []ᵐ)
+
+  -- withDebugOptions : DebugOptions → M A → M A
+  -- withDebugOptions opts x = local (λ where
+  --   env@record { debug = opts' } → record env { debug = specializeDebugOptions opts' opts }) x
+
+  withAppendDebugPath : String → M A → M A
+  withAppendDebugPath path x = local (λ where
+    env@record { options = o@record { debug = opts } } → record env {
+      options = record o { debug = record opts { path = opts .DebugOptions.path ∷ʳ path } } }) x
+
+  noConstraints : M A → M A
+  noConstraints = local λ e → record e { noConstraints = true }
+
+  hasType : Term → Type → M Bool
+  hasType t ty = isSuccessful (noConstraints $ checkType t ty)
+
+  hasType' : Name → Type → M Bool
+  hasType' n ty = isSuccessful $ noConstraints $ do
+    t ← termFromName n
+    t' ← checkType t ty
+    if isAppliedToUnknownsAndMetas t'
+      then return tt
+      else error ("This makes the function return false" ∷ᵈ [])
+    where
+      isUnknownsAndMetas : List (Arg Term) → Bool
+      isUnknownsAndMetas [] = true
+      isUnknownsAndMetas (arg i (meta x x₁) ∷ l) = isUnknownsAndMetas l
+      isUnknownsAndMetas (arg i unknown ∷ l) = isUnknownsAndMetas l
+      isUnknownsAndMetas (arg i _ ∷ l) = false
+
+      isAppliedToUnknownsAndMetas : Term → Bool
+      isAppliedToUnknownsAndMetas (var x args)      = isUnknownsAndMetas args
+      isAppliedToUnknownsAndMetas (con c args)      = isUnknownsAndMetas args
+      isAppliedToUnknownsAndMetas (def f args)      = isUnknownsAndMetas args
+      isAppliedToUnknownsAndMetas (pat-lam cs args) = isUnknownsAndMetas args
+      isAppliedToUnknownsAndMetas (meta x args)     = isUnknownsAndMetas args
+      isAppliedToUnknownsAndMetas _                 = true
+
+  extendContext : String × Arg Type → M A → M A
+  extendContext ty = local λ where e@record { localContext = Γ } → record e { localContext = ty ∷ Γ }
+
+  getContext : M Telescope
+  getContext = reader λ where
+    e@record { localContext = Γ ; globalContext = Γ' } → Γ Data.List.++ Γ'
+
+  getLocalContext : M Telescope
+  getLocalContext = reader λ where e@record { localContext = Γ } → Γ
+
+  inContext : Telescope → M A → M A
+  inContext ctx = local λ e → record e { localContext = ctx }
+
+  -- extend context by multiple variables
+  extendContext' : Telescope → M A → M A
+  extendContext' [] x = x
+  extendContext' (c ∷ cs) x = extendContext c (extendContext' cs x)
+
+  dropContext : ℕ → M A → M A
+  dropContext n x = do
+    ctx ← getContext
+    inContext (drop n ctx) x
+
+  logAndError : List ErrorPart → M A
+  logAndError e = debugLog e >> error e
+
+  error1 : ⦃ IsErrorPart A ⦄ → A → M B
+  error1 a = error (a ∷ᵈ [])
+
+  debugLog1 : ⦃ IsErrorPart A ⦄ → A → M ⊤
+  debugLog1 a = debugLog (a ∷ᵈ [])
+
+  logAndError1 : ⦃ IsErrorPart A ⦄ → A → M B
+  logAndError1 a = debugLog1 a >> error1 a
+
+  markDontFail : String → M A → M A
+  markDontFail s x = catch x λ e → logAndError (s ∷ᵈ " should never fail! This is a bug!\nError:\n" ∷ᵈ e)
+
+  goalTy : M Type
+  goalTy = do
+    inj₁ t ← reader TCEnv.goal
+      where inj₂ T → return T
+    inferType t
+
+  -- take the first result if it's a just, otherwise reset the state and
+  -- run the second computation
+  runSpeculativeMaybe : M (Maybe A) → M A → M A
+  runSpeculativeMaybe x y = do
+    nothing ← runSpeculative (< id , is-just > <$> x)
+      where just a → return a
+    y
+
+  try : List (M ⊤) → M ⊤ → M ⊤
+  try [] e = e
+  try (x ∷ cs) e = MonadError.catch me x (λ _ → try cs e)
+
+  getConstrs : Name → M (List (Name × Type))
+  getConstrs n = do
+    d ← getDefinition n
+    cs ← case d of λ where
+      (record′ c fs)  → return [ c ]
+      (data-type pars cs) → return cs
+      _                   → error (n ∷ᵈ "is not a data or record definition!" ∷ᵈ [])
+    traverse (λ n → (n ,_) <$> (normalise =<< getType n)) (List Name ∋ cs)
+
+  getConstrsForType : Term → M (List (Name × Type))
+  getConstrsForType ty = do
+    (def n _) ← normalise ty
+      where _ → error (ty ∷ᵈ "does not reduce to a definition!" ∷ᵈ [])
+    getConstrs n
+
+  getConstrsForTerm : Term → M (List (Name × Type))
+  getConstrsForTerm t = getConstrsForType =<< inferType t
+
+  -- run a TC computation to arrive at the term under the binder for the pattern
+  withPattern : Telescope → List (Arg Pattern) → M Term → M Clause
+  withPattern tel ps t = Clause.clause tel ps <$> extendContext' tel t
+
+  unifyWithGoal : Term → M ⊤
+  unifyWithGoal t = do
+    inj₁ t' ← reader TCEnv.goal
+      where _ → error1 "unifyWithGoal: Goal is not a term!"
+    unify t' t
+
+  runWithHole : Term → M A → M A
+  runWithHole t = local (λ env → record env { goal = inj₁ t })
+
+  runWithGoalTy : Term → M A → M A
+  runWithGoalTy t = local (λ env → record env { goal = inj₂ t })
+
+  goalHole : M Term
+  goalHole = do
+    inj₂ T ← reader TCEnv.goal
+      where inj₁ hole → return hole
+    newMeta T
+
+  withGoalHole : M ⊤ → M Term
+  withGoalHole tac = do
+    hole ← goalHole
+    runWithHole hole tac
+    return hole
+
+  -- Finding all instance candidates of a given type.
+  findInstances : Type → M (List Term)
+  findInstances ty = runAndReset $ do
+    just m ← findMeta <$> newMeta ty
+      where _ → error1 "[findInstances] newMeta did not produce meta-variable!"
+    getInstances m
+    where
+      open import Data.Maybe using (_<∣>_)
+      findMeta = λ where
+        (pi (arg _ ty) (abs _ t)) → findMeta ty <∣> findMeta t
+        (lam _ (abs _ t))         → findMeta t
+        (meta m _)                → just m
+        _                         → nothing
+
+MonadTC-TC : MonadTC R.TC ⦃ Monad-TC ⦄ ⦃ MonadError-TC ⦄
+MonadTC-TC = record { R; R' using (quoteωTC; withReconstructed; onlyReduceDefs; dontReduceDefs; getInstances) }
 

\ No newline at end of file
diff --git a/Class.Prelude.html b/Class.Prelude.html
index 2c43953..71d47f6 100644
--- a/Class.Prelude.html
+++ b/Class.Prelude.html
@@ -1,5 +1,5 @@
 
-Class.PreludeSource code on Github
{-# OPTIONS --without-K #-}
+Class.PreludeSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Prelude where
 
 open import Agda.Primitive public
diff --git a/Class.Semigroup.Core.html b/Class.Semigroup.Core.html
index 6dac670..7bf090f 100644
--- a/Class.Semigroup.Core.html
+++ b/Class.Semigroup.Core.html
@@ -1,5 +1,5 @@
 
-Class.Semigroup.CoreSource code on Github
{-# OPTIONS --without-K #-}
+Class.Semigroup.CoreSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Semigroup.Core where
 
 open import Class.Prelude
diff --git a/Class.Semigroup.Instances.html b/Class.Semigroup.Instances.html
index 0350df2..5d6eeb3 100644
--- a/Class.Semigroup.Instances.html
+++ b/Class.Semigroup.Instances.html
@@ -1,5 +1,5 @@
 
-Class.Semigroup.InstancesSource code on Github
{-# OPTIONS --without-K #-}
+Class.Semigroup.InstancesSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Semigroup.Instances where
 
 open import Class.Prelude
diff --git a/Class.Semigroup.html b/Class.Semigroup.html
index 52e90ec..096bc06 100644
--- a/Class.Semigroup.html
+++ b/Class.Semigroup.html
@@ -1,5 +1,5 @@
 
-Class.SemigroupSource code on Github
{-# OPTIONS --without-K #-}
+Class.SemigroupSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Semigroup where
 
 open import Class.Semigroup.Core public
diff --git a/Class.Show.Core.html b/Class.Show.Core.html
index e2d738e..165ddcf 100644
--- a/Class.Show.Core.html
+++ b/Class.Show.Core.html
@@ -1,5 +1,5 @@
 
-Class.Show.CoreSource code on Github
{-# OPTIONS --without-K #-}
+Class.Show.CoreSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Show.Core where
 
 open import Class.Prelude
diff --git a/Class.Show.Instances.html b/Class.Show.Instances.html
index 4dce9c1..ad8a5d8 100644
--- a/Class.Show.Instances.html
+++ b/Class.Show.Instances.html
@@ -1,5 +1,5 @@
 
-Class.Show.InstancesSource code on Github
{-# OPTIONS --without-K #-}
+Class.Show.InstancesSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Show.Instances where
 
 open import Class.Prelude hiding (Type)
diff --git a/Class.Show.html b/Class.Show.html
index 1eb1e0c..70f43f8 100644
--- a/Class.Show.html
+++ b/Class.Show.html
@@ -1,5 +1,5 @@
 
-Class.ShowSource code on Github
{-# OPTIONS --without-K #-}
+Class.ShowSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Show where
 
 open import Class.Show.Core public
diff --git a/Class.Traversable.Core.html b/Class.Traversable.Core.html
index a1bbd4a..d19a0d4 100644
--- a/Class.Traversable.Core.html
+++ b/Class.Traversable.Core.html
@@ -1,5 +1,5 @@
 
-Class.Traversable.CoreSource code on Github
{-# OPTIONS --without-K #-}
+Class.Traversable.CoreSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Traversable.Core where
 
 open import Class.Prelude
diff --git a/Class.Traversable.Instances.html b/Class.Traversable.Instances.html
index 454f850..a23a936 100644
--- a/Class.Traversable.Instances.html
+++ b/Class.Traversable.Instances.html
@@ -1,5 +1,5 @@
 
-Class.Traversable.InstancesSource code on Github
{-# OPTIONS --without-K #-}
+Class.Traversable.InstancesSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Traversable.Instances where
 
 open import Class.Prelude
diff --git a/Class.Traversable.html b/Class.Traversable.html
index c9bec94..17d8f16 100644
--- a/Class.Traversable.html
+++ b/Class.Traversable.html
@@ -1,5 +1,5 @@
 
-Class.TraversableSource code on Github
{-# OPTIONS --without-K #-}
+Class.TraversableSource code on Github
{-# OPTIONS --without-K #-}
 module Class.Traversable where
 
 open import Class.Traversable.Core public
diff --git a/Data.Bool.Base.html b/Data.Bool.Base.html
index 63f5a15..4973546 100644
--- a/Data.Bool.Base.html
+++ b/Data.Bool.Base.html
@@ -1,5 +1,5 @@
 
-Data.Bool.BaseSource code on Github
------------------------------------------------------------------------
+Data.Bool.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The type for booleans and some operations
diff --git a/Data.Bool.Properties.html b/Data.Bool.Properties.html
index eb5389d..8111c13 100644
--- a/Data.Bool.Properties.html
+++ b/Data.Bool.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Bool.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Bool.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- A bunch of properties
diff --git a/Data.Bool.Show.html b/Data.Bool.Show.html
index 998d6db..f5a9fa8 100644
--- a/Data.Bool.Show.html
+++ b/Data.Bool.Show.html
@@ -1,5 +1,5 @@
 
-Data.Bool.ShowSource code on Github
------------------------------------------------------------------------
+Data.Bool.ShowSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Showing booleans
diff --git a/Data.Bool.html b/Data.Bool.html
index 46d4467..0f9f05e 100644
--- a/Data.Bool.html
+++ b/Data.Bool.html
@@ -1,5 +1,5 @@
 
-Data.BoolSource code on Github
------------------------------------------------------------------------
+Data.BoolSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Booleans
diff --git a/Data.Char.Base.html b/Data.Char.Base.html
index 1c67ae8..333d5f2 100644
--- a/Data.Char.Base.html
+++ b/Data.Char.Base.html
@@ -1,5 +1,5 @@
 
-Data.Char.BaseSource code on Github
------------------------------------------------------------------------
+Data.Char.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Basic definitions for Characters
diff --git a/Data.Char.Properties.html b/Data.Char.Properties.html
index 60c29ce..2e7ee8c 100644
--- a/Data.Char.Properties.html
+++ b/Data.Char.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Char.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Char.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of operations on characters
diff --git a/Data.Char.html b/Data.Char.html
index 66c8da3..e338858 100644
--- a/Data.Char.html
+++ b/Data.Char.html
@@ -1,5 +1,5 @@
 
-Data.CharSource code on Github
------------------------------------------------------------------------
+Data.CharSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Characters
diff --git a/Data.Container.Core.html b/Data.Container.Core.html
index 3940a5e..6e6723b 100644
--- a/Data.Container.Core.html
+++ b/Data.Container.Core.html
@@ -1,5 +1,5 @@
 
-Data.Container.CoreSource code on Github
------------------------------------------------------------------------
+Data.Container.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Containers core
diff --git a/Data.Container.Membership.html b/Data.Container.Membership.html
index 22e21e7..2384048 100644
--- a/Data.Container.Membership.html
+++ b/Data.Container.Membership.html
@@ -1,5 +1,5 @@
 
-Data.Container.MembershipSource code on Github
------------------------------------------------------------------------
+Data.Container.MembershipSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Membership for containers
diff --git a/Data.Container.Morphism.Properties.html b/Data.Container.Morphism.Properties.html
index 0370687..91c40e6 100644
--- a/Data.Container.Morphism.Properties.html
+++ b/Data.Container.Morphism.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Container.Morphism.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Container.Morphism.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Propertiers of any for containers
diff --git a/Data.Container.Morphism.html b/Data.Container.Morphism.html
index b4d4c06..988ca23 100644
--- a/Data.Container.Morphism.html
+++ b/Data.Container.Morphism.html
@@ -1,5 +1,5 @@
 
-Data.Container.MorphismSource code on Github
------------------------------------------------------------------------
+Data.Container.MorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Container Morphisms
diff --git a/Data.Container.Properties.html b/Data.Container.Properties.html
index 425d650..aa32691 100644
--- a/Data.Container.Properties.html
+++ b/Data.Container.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Container.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Container.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of operations on containers
diff --git a/Data.Container.Related.html b/Data.Container.Related.html
index ab62a38..f183e39 100644
--- a/Data.Container.Related.html
+++ b/Data.Container.Related.html
@@ -1,5 +1,5 @@
 
-Data.Container.RelatedSource code on Github
------------------------------------------------------------------------
+Data.Container.RelatedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Several kinds of "relatedness" for containers such as equivalences,
diff --git a/Data.Container.Relation.Binary.Equality.Setoid.html b/Data.Container.Relation.Binary.Equality.Setoid.html
index a676f2f..631910a 100644
--- a/Data.Container.Relation.Binary.Equality.Setoid.html
+++ b/Data.Container.Relation.Binary.Equality.Setoid.html
@@ -1,5 +1,5 @@
 
-Data.Container.Relation.Binary.Equality.SetoidSource code on Github
------------------------------------------------------------------------
+Data.Container.Relation.Binary.Equality.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Equality over container extensions parametrised by some setoid
diff --git a/Data.Container.Relation.Binary.Pointwise.Properties.html b/Data.Container.Relation.Binary.Pointwise.Properties.html
index 19504c5..d5c57e7 100644
--- a/Data.Container.Relation.Binary.Pointwise.Properties.html
+++ b/Data.Container.Relation.Binary.Pointwise.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Container.Relation.Binary.Pointwise.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Container.Relation.Binary.Pointwise.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of pointwise equality for containers
diff --git a/Data.Container.Relation.Binary.Pointwise.html b/Data.Container.Relation.Binary.Pointwise.html
index b2987a7..0934754 100644
--- a/Data.Container.Relation.Binary.Pointwise.html
+++ b/Data.Container.Relation.Binary.Pointwise.html
@@ -1,5 +1,5 @@
 
-Data.Container.Relation.Binary.PointwiseSource code on Github
------------------------------------------------------------------------
+Data.Container.Relation.Binary.PointwiseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Pointwise equality for containers
diff --git a/Data.Container.Relation.Unary.All.html b/Data.Container.Relation.Unary.All.html
index 262278d..b73a4c7 100644
--- a/Data.Container.Relation.Unary.All.html
+++ b/Data.Container.Relation.Unary.All.html
@@ -1,5 +1,5 @@
 
-Data.Container.Relation.Unary.AllSource code on Github
------------------------------------------------------------------------
+Data.Container.Relation.Unary.AllSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- All (□) for containers
diff --git a/Data.Container.Relation.Unary.Any.html b/Data.Container.Relation.Unary.Any.html
index 5d39f46..6cad2a8 100644
--- a/Data.Container.Relation.Unary.Any.html
+++ b/Data.Container.Relation.Unary.Any.html
@@ -1,5 +1,5 @@
 
-Data.Container.Relation.Unary.AnySource code on Github
------------------------------------------------------------------------
+Data.Container.Relation.Unary.AnySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Any (◇) for containers
diff --git a/Data.Container.html b/Data.Container.html
index 9934ef0..b8c7c02 100644
--- a/Data.Container.html
+++ b/Data.Container.html
@@ -1,5 +1,5 @@
 
-Data.ContainerSource code on Github
------------------------------------------------------------------------
+Data.ContainerSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Containers, based on the work of Abbott and others
diff --git a/Data.Digit.html b/Data.Digit.html
index ccc516f..92eeafe 100644
--- a/Data.Digit.html
+++ b/Data.Digit.html
@@ -1,5 +1,5 @@
 
-Data.DigitSource code on Github
------------------------------------------------------------------------
+Data.DigitSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Digits and digit expansions
diff --git a/Data.Empty.Polymorphic.html b/Data.Empty.Polymorphic.html
index 18c57be..dba3d9c 100644
--- a/Data.Empty.Polymorphic.html
+++ b/Data.Empty.Polymorphic.html
@@ -1,5 +1,5 @@
 
-Data.Empty.PolymorphicSource code on Github
------------------------------------------------------------------------
+Data.Empty.PolymorphicSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Level polymorphic Empty type
diff --git a/Data.Empty.html b/Data.Empty.html
index 8d19a93..a96bdfc 100644
--- a/Data.Empty.html
+++ b/Data.Empty.html
@@ -1,5 +1,5 @@
 
-Data.EmptySource code on Github
------------------------------------------------------------------------
+Data.EmptySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Empty type, judgementally proof irrelevant, Level-monomorphic
diff --git a/Data.Fin.Base.html b/Data.Fin.Base.html
index 0c7ea0d..59d1785 100644
--- a/Data.Fin.Base.html
+++ b/Data.Fin.Base.html
@@ -1,5 +1,5 @@
 
-Data.Fin.BaseSource code on Github
------------------------------------------------------------------------
+Data.Fin.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Finite sets
diff --git a/Data.Fin.Patterns.html b/Data.Fin.Patterns.html
index 899d9f2..41ed510 100644
--- a/Data.Fin.Patterns.html
+++ b/Data.Fin.Patterns.html
@@ -1,5 +1,5 @@
 
-Data.Fin.PatternsSource code on Github
------------------------------------------------------------------------
+Data.Fin.PatternsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Patterns for Fin
diff --git a/Data.Fin.Properties.html b/Data.Fin.Properties.html
index 800ecb9..86524b6 100644
--- a/Data.Fin.Properties.html
+++ b/Data.Fin.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Fin.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Fin.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties related to Fin, and operations making use of these
diff --git a/Data.Fin.html b/Data.Fin.html
index 9fda747..7ba7393 100644
--- a/Data.Fin.html
+++ b/Data.Fin.html
@@ -1,5 +1,5 @@
 
-Data.FinSource code on Github
------------------------------------------------------------------------
+Data.FinSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Finite sets
diff --git a/Data.Float.Base.html b/Data.Float.Base.html
index 3ccd8b5..a2b4bd9 100644
--- a/Data.Float.Base.html
+++ b/Data.Float.Base.html
@@ -1,5 +1,5 @@
 
-Data.Float.BaseSource code on Github
------------------------------------------------------------------------
+Data.Float.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Floats: basic types and operations
diff --git a/Data.Float.Properties.html b/Data.Float.Properties.html
index 200ab17..19bc058 100644
--- a/Data.Float.Properties.html
+++ b/Data.Float.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Float.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Float.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of operations on floats
diff --git a/Data.Float.html b/Data.Float.html
index 1439639..2094233 100644
--- a/Data.Float.html
+++ b/Data.Float.html
@@ -1,5 +1,5 @@
 
-Data.FloatSource code on Github
------------------------------------------------------------------------
+Data.FloatSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Floating point numbers
diff --git a/Data.Integer.Base.html b/Data.Integer.Base.html
index cc60018..ad5041e 100644
--- a/Data.Integer.Base.html
+++ b/Data.Integer.Base.html
@@ -1,5 +1,5 @@
 
-Data.Integer.BaseSource code on Github
------------------------------------------------------------------------
+Data.Integer.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Integers, basic types and operations
diff --git a/Data.Integer.Coprimality.html b/Data.Integer.Coprimality.html
index eccd7c6..67d2f18 100644
--- a/Data.Integer.Coprimality.html
+++ b/Data.Integer.Coprimality.html
@@ -1,5 +1,5 @@
 
-Data.Integer.CoprimalitySource code on Github
------------------------------------------------------------------------
+Data.Integer.CoprimalitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Coprimality
diff --git a/Data.Integer.Divisibility.html b/Data.Integer.Divisibility.html
index cff3969..6acf7de 100644
--- a/Data.Integer.Divisibility.html
+++ b/Data.Integer.Divisibility.html
@@ -1,5 +1,5 @@
 
-Data.Integer.DivisibilitySource code on Github
-----------------------------------------------------------------------
+Data.Integer.DivisibilitySource code on Github
-----------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Unsigned divisibility
diff --git a/Data.Integer.GCD.html b/Data.Integer.GCD.html
index 8d4f3b1..56e94c1 100644
--- a/Data.Integer.GCD.html
+++ b/Data.Integer.GCD.html
@@ -1,5 +1,5 @@
 
-Data.Integer.GCDSource code on Github
------------------------------------------------------------------------
+Data.Integer.GCDSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Greatest Common Divisor for integers
diff --git a/Data.Integer.Properties.NatLemmas.html b/Data.Integer.Properties.NatLemmas.html
index 01e0bf9..7b022ca 100644
--- a/Data.Integer.Properties.NatLemmas.html
+++ b/Data.Integer.Properties.NatLemmas.html
@@ -1,5 +1,5 @@
 
-Data.Integer.Properties.NatLemmasSource code on Github
------------------------------------------------------------------------
+Data.Integer.Properties.NatLemmasSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some extra lemmas about natural numbers only needed for
diff --git a/Data.Integer.Properties.html b/Data.Integer.Properties.html
index 4347981..e5fbae7 100644
--- a/Data.Integer.Properties.html
+++ b/Data.Integer.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Integer.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Integer.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some properties about integers
diff --git a/Data.Integer.Show.html b/Data.Integer.Show.html
index c05710c..2beb804 100644
--- a/Data.Integer.Show.html
+++ b/Data.Integer.Show.html
@@ -1,5 +1,5 @@
 
-Data.Integer.ShowSource code on Github
------------------------------------------------------------------------
+Data.Integer.ShowSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Showing integers
diff --git a/Data.Integer.Solver.html b/Data.Integer.Solver.html
index 4f10214..9893da7 100644
--- a/Data.Integer.Solver.html
+++ b/Data.Integer.Solver.html
@@ -1,5 +1,5 @@
 
-Data.Integer.SolverSource code on Github
------------------------------------------------------------------------
+Data.Integer.SolverSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Automatic solvers for equations over integers
diff --git a/Data.Integer.html b/Data.Integer.html
index 24887cd..fa0c8ad 100644
--- a/Data.Integer.html
+++ b/Data.Integer.html
@@ -1,5 +1,5 @@
 
-Data.IntegerSource code on Github
------------------------------------------------------------------------
+Data.IntegerSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Integers
diff --git a/Data.Irrelevant.html b/Data.Irrelevant.html
index b73a9fd..24a31e9 100644
--- a/Data.Irrelevant.html
+++ b/Data.Irrelevant.html
@@ -1,5 +1,5 @@
 
-Data.IrrelevantSource code on Github
------------------------------------------------------------------------
+Data.IrrelevantSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Wrapper for the proof irrelevance modality
diff --git a/Data.List.Base.html b/Data.List.Base.html
index 76f2550..5f530c0 100644
--- a/Data.List.Base.html
+++ b/Data.List.Base.html
@@ -1,5 +1,5 @@
 
-Data.List.BaseSource code on Github
------------------------------------------------------------------------
+Data.List.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lists, basic types and operations
diff --git a/Data.List.Effectful.html b/Data.List.Effectful.html
index c5953da..3b6d446 100644
--- a/Data.List.Effectful.html
+++ b/Data.List.Effectful.html
@@ -1,5 +1,5 @@
 
-Data.List.EffectfulSource code on Github
------------------------------------------------------------------------
+Data.List.EffectfulSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An effectful view of List
diff --git a/Data.List.Extrema.Core.html b/Data.List.Extrema.Core.html
index 75a92ee..040707c 100644
--- a/Data.List.Extrema.Core.html
+++ b/Data.List.Extrema.Core.html
@@ -1,5 +1,5 @@
 
-Data.List.Extrema.CoreSource code on Github
------------------------------------------------------------------------
+Data.List.Extrema.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core lemmas needed to make list argmin/max functions work
diff --git a/Data.List.Extrema.html b/Data.List.Extrema.html
index 371599e..dcdbea4 100644
--- a/Data.List.Extrema.html
+++ b/Data.List.Extrema.html
@@ -1,5 +1,5 @@
 
-Data.List.ExtremaSource code on Github
------------------------------------------------------------------------
+Data.List.ExtremaSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Finding the maximum/minimum values in a list
diff --git a/Data.List.Membership.DecPropositional.html b/Data.List.Membership.DecPropositional.html
index 6329a12..2d8985c 100644
--- a/Data.List.Membership.DecPropositional.html
+++ b/Data.List.Membership.DecPropositional.html
@@ -1,5 +1,5 @@
 
-Data.List.Membership.DecPropositionalSource code on Github
------------------------------------------------------------------------
+Data.List.Membership.DecPropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Decidable propositional membership over lists
diff --git a/Data.List.Membership.DecSetoid.html b/Data.List.Membership.DecSetoid.html
index 0a463a8..30353a9 100644
--- a/Data.List.Membership.DecSetoid.html
+++ b/Data.List.Membership.DecSetoid.html
@@ -1,5 +1,5 @@
 
-Data.List.Membership.DecSetoidSource code on Github
------------------------------------------------------------------------
+Data.List.Membership.DecSetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Decidable setoid membership over lists
diff --git a/Data.List.Membership.Propositional.Properties.Core.html b/Data.List.Membership.Propositional.Properties.Core.html
index 1477fd6..a4ac90f 100644
--- a/Data.List.Membership.Propositional.Properties.Core.html
+++ b/Data.List.Membership.Propositional.Properties.Core.html
@@ -1,5 +1,5 @@
 
-Data.List.Membership.Propositional.Properties.CoreSource code on Github
------------------------------------------------------------------------
+Data.List.Membership.Propositional.Properties.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core properties related to propositional list membership.
diff --git a/Data.List.Membership.Propositional.Properties.html b/Data.List.Membership.Propositional.Properties.html
index 0aaa4ca..d639fca 100644
--- a/Data.List.Membership.Propositional.Properties.html
+++ b/Data.List.Membership.Propositional.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Membership.Propositional.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Membership.Propositional.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties related to propositional list membership
diff --git a/Data.List.Membership.Propositional.html b/Data.List.Membership.Propositional.html
index 0c707a1..896ee57 100644
--- a/Data.List.Membership.Propositional.html
+++ b/Data.List.Membership.Propositional.html
@@ -1,5 +1,5 @@
 
-Data.List.Membership.PropositionalSource code on Github
------------------------------------------------------------------------
+Data.List.Membership.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Data.List.Any.Membership instantiated with propositional equality,
diff --git a/Data.List.Membership.Setoid.Properties.html b/Data.List.Membership.Setoid.Properties.html
index f18e46f..bcdbf63 100644
--- a/Data.List.Membership.Setoid.Properties.html
+++ b/Data.List.Membership.Setoid.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Membership.Setoid.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Membership.Setoid.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties related to setoid list membership
diff --git a/Data.List.Membership.Setoid.html b/Data.List.Membership.Setoid.html
index b48eab3..f7a9f08 100644
--- a/Data.List.Membership.Setoid.html
+++ b/Data.List.Membership.Setoid.html
@@ -1,5 +1,5 @@
 
-Data.List.Membership.SetoidSource code on Github
------------------------------------------------------------------------
+Data.List.Membership.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- List membership and some related definitions
diff --git a/Data.List.NonEmpty.Base.html b/Data.List.NonEmpty.Base.html
index a789898..83e737d 100644
--- a/Data.List.NonEmpty.Base.html
+++ b/Data.List.NonEmpty.Base.html
@@ -1,5 +1,5 @@
 
-Data.List.NonEmpty.BaseSource code on Github
------------------------------------------------------------------------
+Data.List.NonEmpty.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Non-empty lists: base type and operations
diff --git a/Data.List.NonEmpty.html b/Data.List.NonEmpty.html
index f1c2e2d..7c165a8 100644
--- a/Data.List.NonEmpty.html
+++ b/Data.List.NonEmpty.html
@@ -1,5 +1,5 @@
 
-Data.List.NonEmptySource code on Github
------------------------------------------------------------------------
+Data.List.NonEmptySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Non-empty lists
diff --git a/Data.List.Properties.html b/Data.List.Properties.html
index a8e7976..603342d 100644
--- a/Data.List.Properties.html
+++ b/Data.List.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- List-related properties
diff --git a/Data.List.Relation.Binary.Equality.Propositional.html b/Data.List.Relation.Binary.Equality.Propositional.html
index dbec9ab..f9e59bc 100644
--- a/Data.List.Relation.Binary.Equality.Propositional.html
+++ b/Data.List.Relation.Binary.Equality.Propositional.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Equality.PropositionalSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Equality.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Pointwise equality over lists using propositional equality
diff --git a/Data.List.Relation.Binary.Equality.Setoid.html b/Data.List.Relation.Binary.Equality.Setoid.html
index d82aa4b..1e8cb3b 100644
--- a/Data.List.Relation.Binary.Equality.Setoid.html
+++ b/Data.List.Relation.Binary.Equality.Setoid.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Equality.SetoidSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Equality.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Pointwise equality over lists parameterised by a setoid
diff --git a/Data.List.Relation.Binary.Lex.Core.html b/Data.List.Relation.Binary.Lex.Core.html
index a0cf1f2..e9e1b58 100644
--- a/Data.List.Relation.Binary.Lex.Core.html
+++ b/Data.List.Relation.Binary.Lex.Core.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Lex.CoreSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Lex.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lexicographic ordering of lists
diff --git a/Data.List.Relation.Binary.Lex.Strict.html b/Data.List.Relation.Binary.Lex.Strict.html
index 28d5e44..e0d60e4 100644
--- a/Data.List.Relation.Binary.Lex.Strict.html
+++ b/Data.List.Relation.Binary.Lex.Strict.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Lex.StrictSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Lex.StrictSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lexicographic ordering of lists
diff --git a/Data.List.Relation.Binary.Lex.html b/Data.List.Relation.Binary.Lex.html
index b2debee..8668586 100644
--- a/Data.List.Relation.Binary.Lex.html
+++ b/Data.List.Relation.Binary.Lex.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.LexSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.LexSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lexicographic ordering of lists
diff --git a/Data.List.Relation.Binary.Permutation.Propositional.Properties.html b/Data.List.Relation.Binary.Permutation.Propositional.Properties.html
index 197e687..0fc0069 100644
--- a/Data.List.Relation.Binary.Permutation.Propositional.Properties.html
+++ b/Data.List.Relation.Binary.Permutation.Propositional.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Permutation.Propositional.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Permutation.Propositional.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of permutation
diff --git a/Data.List.Relation.Binary.Permutation.Propositional.html b/Data.List.Relation.Binary.Permutation.Propositional.html
index b7362d9..d4f55da 100644
--- a/Data.List.Relation.Binary.Permutation.Propositional.html
+++ b/Data.List.Relation.Binary.Permutation.Propositional.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Permutation.PropositionalSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Permutation.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An inductive definition for the permutation relation
diff --git a/Data.List.Relation.Binary.Pointwise.Base.html b/Data.List.Relation.Binary.Pointwise.Base.html
index 24d3a8b..619d3b0 100644
--- a/Data.List.Relation.Binary.Pointwise.Base.html
+++ b/Data.List.Relation.Binary.Pointwise.Base.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Pointwise.BaseSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Pointwise.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Pointwise lifting of relations to lists
diff --git a/Data.List.Relation.Binary.Pointwise.Properties.html b/Data.List.Relation.Binary.Pointwise.Properties.html
index a9ff661..e0f5e52 100644
--- a/Data.List.Relation.Binary.Pointwise.Properties.html
+++ b/Data.List.Relation.Binary.Pointwise.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Pointwise.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Pointwise.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of pointwise lifting of relations to lists
diff --git a/Data.List.Relation.Binary.Pointwise.html b/Data.List.Relation.Binary.Pointwise.html
index 0fcb3d1..555cf34 100644
--- a/Data.List.Relation.Binary.Pointwise.html
+++ b/Data.List.Relation.Binary.Pointwise.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.PointwiseSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.PointwiseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Pointwise lifting of relations to lists
diff --git a/Data.List.Relation.Binary.Sublist.Heterogeneous.Core.html b/Data.List.Relation.Binary.Sublist.Heterogeneous.Core.html
index 00e3b39..4000891 100644
--- a/Data.List.Relation.Binary.Sublist.Heterogeneous.Core.html
+++ b/Data.List.Relation.Binary.Sublist.Heterogeneous.Core.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Sublist.Heterogeneous.CoreSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Sublist.Heterogeneous.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- This file contains some core definitions which are re-exported by
diff --git a/Data.List.Relation.Binary.Sublist.Heterogeneous.Properties.html b/Data.List.Relation.Binary.Sublist.Heterogeneous.Properties.html
index 326af9c..3037862 100644
--- a/Data.List.Relation.Binary.Sublist.Heterogeneous.Properties.html
+++ b/Data.List.Relation.Binary.Sublist.Heterogeneous.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Sublist.Heterogeneous.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Sublist.Heterogeneous.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of the heterogeneous sublist relation
diff --git a/Data.List.Relation.Binary.Sublist.Heterogeneous.html b/Data.List.Relation.Binary.Sublist.Heterogeneous.html
index 8b95a50..858f818 100644
--- a/Data.List.Relation.Binary.Sublist.Heterogeneous.html
+++ b/Data.List.Relation.Binary.Sublist.Heterogeneous.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Sublist.HeterogeneousSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Sublist.HeterogeneousSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An inductive definition of the heterogeneous sublist relation
diff --git a/Data.List.Relation.Binary.Sublist.Setoid.Properties.html b/Data.List.Relation.Binary.Sublist.Setoid.Properties.html
index 4920204..dc10adb 100644
--- a/Data.List.Relation.Binary.Sublist.Setoid.Properties.html
+++ b/Data.List.Relation.Binary.Sublist.Setoid.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Sublist.Setoid.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Sublist.Setoid.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of the setoid sublist relation
diff --git a/Data.List.Relation.Binary.Sublist.Setoid.html b/Data.List.Relation.Binary.Sublist.Setoid.html
index e65698b..6e7ba84 100644
--- a/Data.List.Relation.Binary.Sublist.Setoid.html
+++ b/Data.List.Relation.Binary.Sublist.Setoid.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Sublist.SetoidSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Sublist.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An inductive definition of the sublist relation with respect to a
diff --git a/Data.List.Relation.Binary.Subset.Propositional.html b/Data.List.Relation.Binary.Subset.Propositional.html
index b8de5c7..43c94b5 100644
--- a/Data.List.Relation.Binary.Subset.Propositional.html
+++ b/Data.List.Relation.Binary.Subset.Propositional.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Subset.PropositionalSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Subset.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The sublist relation over propositional equality.
diff --git a/Data.List.Relation.Binary.Subset.Setoid.html b/Data.List.Relation.Binary.Subset.Setoid.html
index e44148b..85b91c8 100644
--- a/Data.List.Relation.Binary.Subset.Setoid.html
+++ b/Data.List.Relation.Binary.Subset.Setoid.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Binary.Subset.SetoidSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Binary.Subset.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The extensional sublist relation over setoid equality.
diff --git a/Data.List.Relation.Unary.All.Properties.html b/Data.List.Relation.Unary.All.Properties.html
index 201c84c..9c87e74 100644
--- a/Data.List.Relation.Unary.All.Properties.html
+++ b/Data.List.Relation.Unary.All.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.All.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.All.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties related to All
diff --git a/Data.List.Relation.Unary.All.html b/Data.List.Relation.Unary.All.html
index cfacf1e..0a24d30 100644
--- a/Data.List.Relation.Unary.All.html
+++ b/Data.List.Relation.Unary.All.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.AllSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.AllSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lists where all elements satisfy a given property
diff --git a/Data.List.Relation.Unary.AllPairs.Core.html b/Data.List.Relation.Unary.AllPairs.Core.html
index 0c521a3..fe34ff9 100644
--- a/Data.List.Relation.Unary.AllPairs.Core.html
+++ b/Data.List.Relation.Unary.AllPairs.Core.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.AllPairs.CoreSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.AllPairs.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lists where every pair of elements are related (symmetrically)
diff --git a/Data.List.Relation.Unary.AllPairs.Properties.html b/Data.List.Relation.Unary.AllPairs.Properties.html
index f4ba257..857dce3 100644
--- a/Data.List.Relation.Unary.AllPairs.Properties.html
+++ b/Data.List.Relation.Unary.AllPairs.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.AllPairs.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.AllPairs.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties related to AllPairs
diff --git a/Data.List.Relation.Unary.AllPairs.html b/Data.List.Relation.Unary.AllPairs.html
index e141ecf..a0a5062 100644
--- a/Data.List.Relation.Unary.AllPairs.html
+++ b/Data.List.Relation.Unary.AllPairs.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.AllPairsSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.AllPairsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lists where every pair of elements are related (symmetrically)
diff --git a/Data.List.Relation.Unary.Any.Properties.html b/Data.List.Relation.Unary.Any.Properties.html
index 0349d34..1589157 100644
--- a/Data.List.Relation.Unary.Any.Properties.html
+++ b/Data.List.Relation.Unary.Any.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.Any.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.Any.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties related to Any
diff --git a/Data.List.Relation.Unary.Any.html b/Data.List.Relation.Unary.Any.html
index 7770e05..ca8779e 100644
--- a/Data.List.Relation.Unary.Any.html
+++ b/Data.List.Relation.Unary.Any.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.AnySource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.AnySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lists where at least one element satisfies a given property
diff --git a/Data.List.Relation.Unary.Linked.Properties.html b/Data.List.Relation.Unary.Linked.Properties.html
index 14990c6..e633609 100644
--- a/Data.List.Relation.Unary.Linked.Properties.html
+++ b/Data.List.Relation.Unary.Linked.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.Linked.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.Linked.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties related to Linked
diff --git a/Data.List.Relation.Unary.Linked.html b/Data.List.Relation.Unary.Linked.html
index 818eace..aafca86 100644
--- a/Data.List.Relation.Unary.Linked.html
+++ b/Data.List.Relation.Unary.Linked.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.LinkedSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.LinkedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lists where every consecutative pair of elements is related.
diff --git a/Data.List.Relation.Unary.Sorted.TotalOrder.Properties.html b/Data.List.Relation.Unary.Sorted.TotalOrder.Properties.html
index c8de0d1..34305d1 100644
--- a/Data.List.Relation.Unary.Sorted.TotalOrder.Properties.html
+++ b/Data.List.Relation.Unary.Sorted.TotalOrder.Properties.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.Sorted.TotalOrder.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.Sorted.TotalOrder.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Sorted lists
diff --git a/Data.List.Relation.Unary.Sorted.TotalOrder.html b/Data.List.Relation.Unary.Sorted.TotalOrder.html
index fa310ac..2fa4294 100644
--- a/Data.List.Relation.Unary.Sorted.TotalOrder.html
+++ b/Data.List.Relation.Unary.Sorted.TotalOrder.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.Sorted.TotalOrderSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.Sorted.TotalOrderSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Sorted lists
diff --git a/Data.List.Relation.Unary.Unique.Setoid.html b/Data.List.Relation.Unary.Unique.Setoid.html
index 338de3a..14b5f50 100644
--- a/Data.List.Relation.Unary.Unique.Setoid.html
+++ b/Data.List.Relation.Unary.Unique.Setoid.html
@@ -1,5 +1,5 @@
 
-Data.List.Relation.Unary.Unique.SetoidSource code on Github
------------------------------------------------------------------------
+Data.List.Relation.Unary.Unique.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lists made up entirely of unique elements (setoid equality)
diff --git a/Data.List.Scans.Base.html b/Data.List.Scans.Base.html
index 38de22c..992c7a9 100644
--- a/Data.List.Scans.Base.html
+++ b/Data.List.Scans.Base.html
@@ -1,5 +1,5 @@
 
-Data.List.Scans.BaseSource code on Github
------------------------------------------------------------------------
+Data.List.Scans.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- List scans: definitions
diff --git a/Data.List.Sort.Base.html b/Data.List.Sort.Base.html
index 6562fab..709800c 100644
--- a/Data.List.Sort.Base.html
+++ b/Data.List.Sort.Base.html
@@ -1,5 +1,5 @@
 
-Data.List.Sort.BaseSource code on Github
------------------------------------------------------------------------
+Data.List.Sort.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The core definition of a sorting algorithm
diff --git a/Data.List.Sort.MergeSort.html b/Data.List.Sort.MergeSort.html
index 6f592ce..a72cb9f 100644
--- a/Data.List.Sort.MergeSort.html
+++ b/Data.List.Sort.MergeSort.html
@@ -1,5 +1,5 @@
 
-Data.List.Sort.MergeSortSource code on Github
------------------------------------------------------------------------
+Data.List.Sort.MergeSortSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An implementation of merge sort along with proofs of correctness.
diff --git a/Data.List.Sort.html b/Data.List.Sort.html
index c16f93f..3af90dd 100644
--- a/Data.List.Sort.html
+++ b/Data.List.Sort.html
@@ -1,5 +1,5 @@
 
-Data.List.SortSource code on Github
------------------------------------------------------------------------
+Data.List.SortSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Functions and definitions for sorting lists
diff --git a/Data.List.html b/Data.List.html
index 47af636..bf007db 100644
--- a/Data.List.html
+++ b/Data.List.html
@@ -1,5 +1,5 @@
 
-Data.ListSource code on Github
------------------------------------------------------------------------
+Data.ListSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lists
diff --git a/Data.Maybe.Base.html b/Data.Maybe.Base.html
index 7c614f4..3c8e338 100644
--- a/Data.Maybe.Base.html
+++ b/Data.Maybe.Base.html
@@ -1,5 +1,5 @@
 
-Data.Maybe.BaseSource code on Github
------------------------------------------------------------------------
+Data.Maybe.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The Maybe type and some operations
diff --git a/Data.Maybe.Effectful.html b/Data.Maybe.Effectful.html
index 1dd10cd..dad6490 100644
--- a/Data.Maybe.Effectful.html
+++ b/Data.Maybe.Effectful.html
@@ -1,5 +1,5 @@
 
-Data.Maybe.EffectfulSource code on Github
------------------------------------------------------------------------
+Data.Maybe.EffectfulSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An effectful view of Maybe
diff --git a/Data.Maybe.Properties.html b/Data.Maybe.Properties.html
index d1441e6..72dfa1d 100644
--- a/Data.Maybe.Properties.html
+++ b/Data.Maybe.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Maybe.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Maybe.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Maybe-related properties
diff --git a/Data.Maybe.Relation.Binary.Connected.html b/Data.Maybe.Relation.Binary.Connected.html
index 5311746..eb9ded3 100644
--- a/Data.Maybe.Relation.Binary.Connected.html
+++ b/Data.Maybe.Relation.Binary.Connected.html
@@ -1,5 +1,5 @@
 
-Data.Maybe.Relation.Binary.ConnectedSource code on Github
------------------------------------------------------------------------
+Data.Maybe.Relation.Binary.ConnectedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lifting a relation such that `nothing` is also related to `just`
diff --git a/Data.Maybe.Relation.Binary.Pointwise.html b/Data.Maybe.Relation.Binary.Pointwise.html
index 8073900..2162dce 100644
--- a/Data.Maybe.Relation.Binary.Pointwise.html
+++ b/Data.Maybe.Relation.Binary.Pointwise.html
@@ -1,5 +1,5 @@
 
-Data.Maybe.Relation.Binary.PointwiseSource code on Github
------------------------------------------------------------------------
+Data.Maybe.Relation.Binary.PointwiseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Pointwise lifting of relations to maybes
diff --git a/Data.Maybe.Relation.Unary.All.html b/Data.Maybe.Relation.Unary.All.html
index 39be87b..aee7a37 100644
--- a/Data.Maybe.Relation.Unary.All.html
+++ b/Data.Maybe.Relation.Unary.All.html
@@ -1,5 +1,5 @@
 
-Data.Maybe.Relation.Unary.AllSource code on Github
------------------------------------------------------------------------
+Data.Maybe.Relation.Unary.AllSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Maybes where all the elements satisfy a given property
diff --git a/Data.Maybe.Relation.Unary.Any.html b/Data.Maybe.Relation.Unary.Any.html
index 751e818..d47f268 100644
--- a/Data.Maybe.Relation.Unary.Any.html
+++ b/Data.Maybe.Relation.Unary.Any.html
@@ -1,5 +1,5 @@
 
-Data.Maybe.Relation.Unary.AnySource code on Github
------------------------------------------------------------------------
+Data.Maybe.Relation.Unary.AnySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Maybes where one of the elements satisfies a given property
diff --git a/Data.Maybe.html b/Data.Maybe.html
index cc3a21b..b7faf89 100644
--- a/Data.Maybe.html
+++ b/Data.Maybe.html
@@ -1,5 +1,5 @@
 
-Data.MaybeSource code on Github
------------------------------------------------------------------------
+Data.MaybeSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The Maybe type
diff --git a/Data.Nat.Base.html b/Data.Nat.Base.html
index 08f1e17..306f390 100644
--- a/Data.Nat.Base.html
+++ b/Data.Nat.Base.html
@@ -1,5 +1,5 @@
 
-Data.Nat.BaseSource code on Github
------------------------------------------------------------------------
+Data.Nat.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Natural numbers, basic types and operations
diff --git a/Data.Nat.Coprimality.html b/Data.Nat.Coprimality.html
index 5b12018..f9e6711 100644
--- a/Data.Nat.Coprimality.html
+++ b/Data.Nat.Coprimality.html
@@ -1,5 +1,5 @@
 
-Data.Nat.CoprimalitySource code on Github
------------------------------------------------------------------------
+Data.Nat.CoprimalitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Coprimality
diff --git a/Data.Nat.DivMod.Core.html b/Data.Nat.DivMod.Core.html
index 4686074..5020f82 100644
--- a/Data.Nat.DivMod.Core.html
+++ b/Data.Nat.DivMod.Core.html
@@ -1,5 +1,5 @@
 
-Data.Nat.DivMod.CoreSource code on Github
------------------------------------------------------------------------
+Data.Nat.DivMod.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core lemmas for division and modulus operations
diff --git a/Data.Nat.DivMod.html b/Data.Nat.DivMod.html
index 46c9c51..104cf87 100644
--- a/Data.Nat.DivMod.html
+++ b/Data.Nat.DivMod.html
@@ -1,5 +1,5 @@
 
-Data.Nat.DivModSource code on Github
------------------------------------------------------------------------
+Data.Nat.DivModSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Natural number division
diff --git a/Data.Nat.Divisibility.Core.html b/Data.Nat.Divisibility.Core.html
index 1def40d..656ad85 100644
--- a/Data.Nat.Divisibility.Core.html
+++ b/Data.Nat.Divisibility.Core.html
@@ -1,5 +1,5 @@
 
-Data.Nat.Divisibility.CoreSource code on Github
------------------------------------------------------------------------
+Data.Nat.Divisibility.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core definition of divisibility
diff --git a/Data.Nat.Divisibility.html b/Data.Nat.Divisibility.html
index 8c39f21..ba2d5e6 100644
--- a/Data.Nat.Divisibility.html
+++ b/Data.Nat.Divisibility.html
@@ -1,5 +1,5 @@
 
-Data.Nat.DivisibilitySource code on Github
------------------------------------------------------------------------
+Data.Nat.DivisibilitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Divisibility
diff --git a/Data.Nat.GCD.Lemmas.html b/Data.Nat.GCD.Lemmas.html
index 43f8c49..4d6a708 100644
--- a/Data.Nat.GCD.Lemmas.html
+++ b/Data.Nat.GCD.Lemmas.html
@@ -1,5 +1,5 @@
 
-Data.Nat.GCD.LemmasSource code on Github
------------------------------------------------------------------------
+Data.Nat.GCD.LemmasSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Boring lemmas used in Data.Nat.GCD and Data.Nat.Coprimality
diff --git a/Data.Nat.GCD.html b/Data.Nat.GCD.html
index 92e4f1a..eb671f8 100644
--- a/Data.Nat.GCD.html
+++ b/Data.Nat.GCD.html
@@ -1,5 +1,5 @@
 
-Data.Nat.GCDSource code on Github
------------------------------------------------------------------------
+Data.Nat.GCDSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Greatest common divisor
diff --git a/Data.Nat.GeneralisedArithmetic.html b/Data.Nat.GeneralisedArithmetic.html
index 2c43672..fc4b0ad 100644
--- a/Data.Nat.GeneralisedArithmetic.html
+++ b/Data.Nat.GeneralisedArithmetic.html
@@ -1,5 +1,5 @@
 
-Data.Nat.GeneralisedArithmeticSource code on Github
------------------------------------------------------------------------
+Data.Nat.GeneralisedArithmeticSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- A generalisation of the arithmetic operations
diff --git a/Data.Nat.Induction.html b/Data.Nat.Induction.html
index 2769e9b..95fcb36 100644
--- a/Data.Nat.Induction.html
+++ b/Data.Nat.Induction.html
@@ -1,5 +1,5 @@
 
-Data.Nat.InductionSource code on Github
------------------------------------------------------------------------
+Data.Nat.InductionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Various forms of induction for natural numbers
diff --git a/Data.Nat.Primality.html b/Data.Nat.Primality.html
index fa1f4ea..c4c5914 100644
--- a/Data.Nat.Primality.html
+++ b/Data.Nat.Primality.html
@@ -1,5 +1,5 @@
 
-Data.Nat.PrimalitySource code on Github
------------------------------------------------------------------------
+Data.Nat.PrimalitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Primality
diff --git a/Data.Nat.Properties.html b/Data.Nat.Properties.html
index 6e3c36e..2cc619a 100644
--- a/Data.Nat.Properties.html
+++ b/Data.Nat.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Nat.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Nat.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- A bunch of properties about natural number operations
diff --git a/Data.Nat.Show.html b/Data.Nat.Show.html
index efd0b08..89951b5 100644
--- a/Data.Nat.Show.html
+++ b/Data.Nat.Show.html
@@ -1,5 +1,5 @@
 
-Data.Nat.ShowSource code on Github
------------------------------------------------------------------------
+Data.Nat.ShowSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Showing natural numbers
diff --git a/Data.Nat.html b/Data.Nat.html
index 605b23c..92b57ae 100644
--- a/Data.Nat.html
+++ b/Data.Nat.html
@@ -1,5 +1,5 @@
 
-Data.NatSource code on Github
------------------------------------------------------------------------
+Data.NatSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Natural numbers
diff --git a/Data.Parity.Base.html b/Data.Parity.Base.html
index 22d0b18..0d361c3 100644
--- a/Data.Parity.Base.html
+++ b/Data.Parity.Base.html
@@ -1,5 +1,5 @@
 
-Data.Parity.BaseSource code on Github
------------------------------------------------------------------------
+Data.Parity.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Parity
diff --git a/Data.Product.Algebra.html b/Data.Product.Algebra.html
index 7cf5712..eef915d 100644
--- a/Data.Product.Algebra.html
+++ b/Data.Product.Algebra.html
@@ -1,5 +1,5 @@
 
-Data.Product.AlgebraSource code on Github
------------------------------------------------------------------------
+Data.Product.AlgebraSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Algebraic properties of products
diff --git a/Data.Product.Base.html b/Data.Product.Base.html
index 9a85e3a..bef8cd0 100644
--- a/Data.Product.Base.html
+++ b/Data.Product.Base.html
@@ -1,5 +1,5 @@
 
-Data.Product.BaseSource code on Github
------------------------------------------------------------------------
+Data.Product.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Products
diff --git a/Data.Product.Function.Dependent.Propositional.html b/Data.Product.Function.Dependent.Propositional.html
index 9f27c79..b1f2acb 100644
--- a/Data.Product.Function.Dependent.Propositional.html
+++ b/Data.Product.Function.Dependent.Propositional.html
@@ -1,5 +1,5 @@
 
-Data.Product.Function.Dependent.PropositionalSource code on Github
------------------------------------------------------------------------
+Data.Product.Function.Dependent.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Dependent product combinators for propositional equality
diff --git a/Data.Product.Function.NonDependent.Propositional.html b/Data.Product.Function.NonDependent.Propositional.html
index 27c0739..1a3fa8f 100644
--- a/Data.Product.Function.NonDependent.Propositional.html
+++ b/Data.Product.Function.NonDependent.Propositional.html
@@ -1,5 +1,5 @@
 
-Data.Product.Function.NonDependent.PropositionalSource code on Github
------------------------------------------------------------------------
+Data.Product.Function.NonDependent.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Non-dependent product combinators for propositional equality
diff --git a/Data.Product.Function.NonDependent.Setoid.html b/Data.Product.Function.NonDependent.Setoid.html
index 7766816..24b4759 100644
--- a/Data.Product.Function.NonDependent.Setoid.html
+++ b/Data.Product.Function.NonDependent.Setoid.html
@@ -1,5 +1,5 @@
 
-Data.Product.Function.NonDependent.SetoidSource code on Github
------------------------------------------------------------------------
+Data.Product.Function.NonDependent.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Non-dependent product combinators for setoid equality preserving
diff --git a/Data.Product.Nary.NonDependent.html b/Data.Product.Nary.NonDependent.html
index 9578301..9c88288 100644
--- a/Data.Product.Nary.NonDependent.html
+++ b/Data.Product.Nary.NonDependent.html
@@ -1,5 +1,5 @@
 
-Data.Product.Nary.NonDependentSource code on Github
------------------------------------------------------------------------
+Data.Product.Nary.NonDependentSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Nondependent heterogeneous N-ary products
diff --git a/Data.Product.Properties.html b/Data.Product.Properties.html
index 6914e0a..fc3c2ea 100644
--- a/Data.Product.Properties.html
+++ b/Data.Product.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Product.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Product.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of products
diff --git a/Data.Product.Relation.Binary.Pointwise.NonDependent.html b/Data.Product.Relation.Binary.Pointwise.NonDependent.html
index dbdcd13..2281b41 100644
--- a/Data.Product.Relation.Binary.Pointwise.NonDependent.html
+++ b/Data.Product.Relation.Binary.Pointwise.NonDependent.html
@@ -1,5 +1,5 @@
 
-Data.Product.Relation.Binary.Pointwise.NonDependentSource code on Github
------------------------------------------------------------------------
+Data.Product.Relation.Binary.Pointwise.NonDependentSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Pointwise products of binary relations
diff --git a/Data.Product.Relation.Unary.All.html b/Data.Product.Relation.Unary.All.html
index 68da301..e381c9b 100644
--- a/Data.Product.Relation.Unary.All.html
+++ b/Data.Product.Relation.Unary.All.html
@@ -1,5 +1,5 @@
 
-Data.Product.Relation.Unary.AllSource code on Github
------------------------------------------------------------------------
+Data.Product.Relation.Unary.AllSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lifting of two predicates
diff --git a/Data.Product.html b/Data.Product.html
index 52874c9..3b23eb0 100644
--- a/Data.Product.html
+++ b/Data.Product.html
@@ -1,5 +1,5 @@
 
-Data.ProductSource code on Github
------------------------------------------------------------------------
+Data.ProductSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Products
diff --git a/Data.Rational.Base.html b/Data.Rational.Base.html
index 23eb622..8a4cd88 100644
--- a/Data.Rational.Base.html
+++ b/Data.Rational.Base.html
@@ -1,5 +1,5 @@
 
-Data.Rational.BaseSource code on Github
------------------------------------------------------------------------
+Data.Rational.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Rational numbers
diff --git a/Data.Rational.Properties.html b/Data.Rational.Properties.html
index 5446e82..b97d603 100644
--- a/Data.Rational.Properties.html
+++ b/Data.Rational.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Rational.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Rational.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of Rational numbers
diff --git a/Data.Rational.Unnormalised.Base.html b/Data.Rational.Unnormalised.Base.html
index 86d2d8f..354e37c 100644
--- a/Data.Rational.Unnormalised.Base.html
+++ b/Data.Rational.Unnormalised.Base.html
@@ -1,5 +1,5 @@
 
-Data.Rational.Unnormalised.BaseSource code on Github
------------------------------------------------------------------------
+Data.Rational.Unnormalised.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Rational numbers in non-reduced form.
diff --git a/Data.Rational.Unnormalised.Properties.html b/Data.Rational.Unnormalised.Properties.html
index 4ed52bd..d9933c4 100644
--- a/Data.Rational.Unnormalised.Properties.html
+++ b/Data.Rational.Unnormalised.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Rational.Unnormalised.PropertiesSource code on Github
-----------------------------------------------------------------------
+Data.Rational.Unnormalised.PropertiesSource code on Github
-----------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of unnormalized Rational numbers
diff --git a/Data.Rational.html b/Data.Rational.html
index 5a0265f..bd02adc 100644
--- a/Data.Rational.html
+++ b/Data.Rational.html
@@ -1,5 +1,5 @@
 
-Data.RationalSource code on Github
------------------------------------------------------------------------
+Data.RationalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Rational numbers
diff --git a/Data.Record.html b/Data.Record.html
index 2d6cc8a..89e7875 100644
--- a/Data.Record.html
+++ b/Data.Record.html
@@ -1,5 +1,5 @@
 
-Data.RecordSource code on Github
------------------------------------------------------------------------
+Data.RecordSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Record types with manifest fields and "with", based on Randy
diff --git a/Data.Refinement.html b/Data.Refinement.html
index 93165d2..112fc68 100644
--- a/Data.Refinement.html
+++ b/Data.Refinement.html
@@ -1,5 +1,5 @@
 
-Data.RefinementSource code on Github
------------------------------------------------------------------------
+Data.RefinementSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Refinement type: a value together with a proof irrelevant witness.
diff --git a/Data.Sign.Base.html b/Data.Sign.Base.html
index 1549019..65afc1a 100644
--- a/Data.Sign.Base.html
+++ b/Data.Sign.Base.html
@@ -1,5 +1,5 @@
 
-Data.Sign.BaseSource code on Github
------------------------------------------------------------------------
+Data.Sign.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Signs
diff --git a/Data.Sign.Properties.html b/Data.Sign.Properties.html
index 70ce186..592dab8 100644
--- a/Data.Sign.Properties.html
+++ b/Data.Sign.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Sign.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Sign.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some properties about signs
diff --git a/Data.Sign.html b/Data.Sign.html
index c976b3d..86323ce 100644
--- a/Data.Sign.html
+++ b/Data.Sign.html
@@ -1,5 +1,5 @@
 
-Data.SignSource code on Github
------------------------------------------------------------------------
+Data.SignSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Signs
diff --git a/Data.String.Base.html b/Data.String.Base.html
index f8787cd..dbad373 100644
--- a/Data.String.Base.html
+++ b/Data.String.Base.html
@@ -1,5 +1,5 @@
 
-Data.String.BaseSource code on Github
------------------------------------------------------------------------
+Data.String.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Strings: builtin type and basic operations
diff --git a/Data.String.Properties.html b/Data.String.Properties.html
index 7ca94cd..f7288c2 100644
--- a/Data.String.Properties.html
+++ b/Data.String.Properties.html
@@ -1,5 +1,5 @@
 
-Data.String.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.String.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of operations on strings
diff --git a/Data.String.html b/Data.String.html
index 9b3e514..975ac85 100644
--- a/Data.String.html
+++ b/Data.String.html
@@ -1,5 +1,5 @@
 
-Data.StringSource code on Github
------------------------------------------------------------------------
+Data.StringSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Strings
diff --git a/Data.Sum.Algebra.html b/Data.Sum.Algebra.html
index ad85eef..de387ad 100644
--- a/Data.Sum.Algebra.html
+++ b/Data.Sum.Algebra.html
@@ -1,5 +1,5 @@
 
-Data.Sum.AlgebraSource code on Github
------------------------------------------------------------------------
+Data.Sum.AlgebraSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Algebraic properties of sums (disjoint unions)
diff --git a/Data.Sum.Base.html b/Data.Sum.Base.html
index 05eef76..843024b 100644
--- a/Data.Sum.Base.html
+++ b/Data.Sum.Base.html
@@ -1,5 +1,5 @@
 
-Data.Sum.BaseSource code on Github
------------------------------------------------------------------------
+Data.Sum.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Sums (disjoint unions)
diff --git a/Data.Sum.Effectful.Left.html b/Data.Sum.Effectful.Left.html
index 4d70eff..8e6fbf5 100644
--- a/Data.Sum.Effectful.Left.html
+++ b/Data.Sum.Effectful.Left.html
@@ -1,5 +1,5 @@
 
-Data.Sum.Effectful.LeftSource code on Github
------------------------------------------------------------------------
+Data.Sum.Effectful.LeftSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An effectful view of the Sum type (Left-biased)
diff --git a/Data.Sum.Function.Propositional.html b/Data.Sum.Function.Propositional.html
index 4f78c7a..4b6ef10 100644
--- a/Data.Sum.Function.Propositional.html
+++ b/Data.Sum.Function.Propositional.html
@@ -1,5 +1,5 @@
 
-Data.Sum.Function.PropositionalSource code on Github
------------------------------------------------------------------------
+Data.Sum.Function.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Sum combinators for propositional equality preserving functions
diff --git a/Data.Sum.Function.Setoid.html b/Data.Sum.Function.Setoid.html
index 91a7af5..4caeae6 100644
--- a/Data.Sum.Function.Setoid.html
+++ b/Data.Sum.Function.Setoid.html
@@ -1,5 +1,5 @@
 
-Data.Sum.Function.SetoidSource code on Github
------------------------------------------------------------------------
+Data.Sum.Function.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Sum combinators for setoid equality preserving functions
diff --git a/Data.Sum.Properties.html b/Data.Sum.Properties.html
index 7fdd98e..1a802a0 100644
--- a/Data.Sum.Properties.html
+++ b/Data.Sum.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Sum.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Sum.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of sums (disjoint unions)
diff --git a/Data.Sum.Relation.Binary.Pointwise.html b/Data.Sum.Relation.Binary.Pointwise.html
index 036be6f..c512455 100644
--- a/Data.Sum.Relation.Binary.Pointwise.html
+++ b/Data.Sum.Relation.Binary.Pointwise.html
@@ -1,5 +1,5 @@
 
-Data.Sum.Relation.Binary.PointwiseSource code on Github
------------------------------------------------------------------------
+Data.Sum.Relation.Binary.PointwiseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Pointwise sum
diff --git a/Data.Sum.html b/Data.Sum.html
index b9030ea..1997893 100644
--- a/Data.Sum.html
+++ b/Data.Sum.html
@@ -1,5 +1,5 @@
 
-Data.SumSource code on Github
------------------------------------------------------------------------
+Data.SumSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Sums (disjoint unions)
diff --git a/Data.These.Base.html b/Data.These.Base.html
index 3c6537d..1108f3d 100644
--- a/Data.These.Base.html
+++ b/Data.These.Base.html
@@ -1,5 +1,5 @@
 
-Data.These.BaseSource code on Github
------------------------------------------------------------------------
+Data.These.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An either-or-both data type, basic type and operations
diff --git a/Data.These.Properties.html b/Data.These.Properties.html
index 02bfee5..0d88b05 100644
--- a/Data.These.Properties.html
+++ b/Data.These.Properties.html
@@ -1,5 +1,5 @@
 
-Data.These.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.These.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of These
diff --git a/Data.These.html b/Data.These.html
index 27043c5..0a0cb47 100644
--- a/Data.These.html
+++ b/Data.These.html
@@ -1,5 +1,5 @@
 
-Data.TheseSource code on Github
------------------------------------------------------------------------
+Data.TheseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An either-or-both data type
diff --git a/Data.Unit.Base.html b/Data.Unit.Base.html
index d39ffad..ffa742c 100644
--- a/Data.Unit.Base.html
+++ b/Data.Unit.Base.html
@@ -1,5 +1,5 @@
 
-Data.Unit.BaseSource code on Github
------------------------------------------------------------------------
+Data.Unit.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The unit type and the total relation on unit
diff --git a/Data.Unit.Polymorphic.Base.html b/Data.Unit.Polymorphic.Base.html
index 9e9f7ea..1d0c779 100644
--- a/Data.Unit.Polymorphic.Base.html
+++ b/Data.Unit.Polymorphic.Base.html
@@ -1,5 +1,5 @@
 
-Data.Unit.Polymorphic.BaseSource code on Github
------------------------------------------------------------------------
+Data.Unit.Polymorphic.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- A universe polymorphic unit type, as a Lift of the Level 0 one.
diff --git a/Data.Unit.Polymorphic.Properties.html b/Data.Unit.Polymorphic.Properties.html
index 3dd2a8d..5ef1b79 100644
--- a/Data.Unit.Polymorphic.Properties.html
+++ b/Data.Unit.Polymorphic.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Unit.Polymorphic.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Unit.Polymorphic.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of the polymorphic unit type
diff --git a/Data.Unit.Polymorphic.html b/Data.Unit.Polymorphic.html
index ca6ed69..84e5bf5 100644
--- a/Data.Unit.Polymorphic.html
+++ b/Data.Unit.Polymorphic.html
@@ -1,5 +1,5 @@
 
-Data.Unit.PolymorphicSource code on Github
------------------------------------------------------------------------
+Data.Unit.PolymorphicSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The universe polymorphic unit type and the total relation on unit
diff --git a/Data.Unit.Properties.html b/Data.Unit.Properties.html
index 12fed35..7c5677a 100644
--- a/Data.Unit.Properties.html
+++ b/Data.Unit.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Unit.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Unit.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of the unit type
diff --git a/Data.Unit.html b/Data.Unit.html
index 1435b7d..fcda1ba 100644
--- a/Data.Unit.html
+++ b/Data.Unit.html
@@ -1,5 +1,5 @@
 
-Data.UnitSource code on Github
------------------------------------------------------------------------
+Data.UnitSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The unit type, Level-monomorphic version
diff --git a/Data.Universe.html b/Data.Universe.html
index 725375a..0fb1eb5 100644
--- a/Data.Universe.html
+++ b/Data.Universe.html
@@ -1,5 +1,5 @@
 
-Data.UniverseSource code on Github
------------------------------------------------------------------------
+Data.UniverseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Universes
diff --git a/Data.Vec.Base.html b/Data.Vec.Base.html
index 263e588..553a50e 100644
--- a/Data.Vec.Base.html
+++ b/Data.Vec.Base.html
@@ -1,5 +1,5 @@
 
-Data.Vec.BaseSource code on Github
------------------------------------------------------------------------
+Data.Vec.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Vectors, basic types and operations
diff --git a/Data.Vec.Bounded.Base.html b/Data.Vec.Bounded.Base.html
index 7f8bb07..5170c6a 100644
--- a/Data.Vec.Bounded.Base.html
+++ b/Data.Vec.Bounded.Base.html
@@ -1,5 +1,5 @@
 
-Data.Vec.Bounded.BaseSource code on Github
------------------------------------------------------------------------
+Data.Vec.Bounded.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bounded vectors, basic types and operations
diff --git a/Data.Vec.Functional.html b/Data.Vec.Functional.html
index d0103ec..840d1cf 100644
--- a/Data.Vec.Functional.html
+++ b/Data.Vec.Functional.html
@@ -1,5 +1,5 @@
 
-Data.Vec.FunctionalSource code on Github
------------------------------------------------------------------------
+Data.Vec.FunctionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Vectors defined as functions from a finite set to a type.
diff --git a/Data.Vec.N-ary.html b/Data.Vec.N-ary.html
index c4d6ad0..e7ed665 100644
--- a/Data.Vec.N-ary.html
+++ b/Data.Vec.N-ary.html
@@ -1,5 +1,5 @@
 
-Data.Vec.N-arySource code on Github
------------------------------------------------------------------------
+Data.Vec.N-arySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Code for converting Vec A n → B to and from n-ary functions
diff --git a/Data.Vec.Properties.html b/Data.Vec.Properties.html
index 9511499..ec93b01 100644
--- a/Data.Vec.Properties.html
+++ b/Data.Vec.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Vec.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Vec.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some Vec-related properties
diff --git a/Data.Vec.Relation.Binary.Equality.Cast.html b/Data.Vec.Relation.Binary.Equality.Cast.html
index 115b5bb..1b8e434 100644
--- a/Data.Vec.Relation.Binary.Equality.Cast.html
+++ b/Data.Vec.Relation.Binary.Equality.Cast.html
@@ -1,5 +1,5 @@
 
-Data.Vec.Relation.Binary.Equality.CastSource code on Github
------------------------------------------------------------------------
+Data.Vec.Relation.Binary.Equality.CastSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An equational reasoning library for propositional equality over
diff --git a/Data.Vec.html b/Data.Vec.html
index bb985ff..5ea272d 100644
--- a/Data.Vec.html
+++ b/Data.Vec.html
@@ -1,5 +1,5 @@
 
-Data.VecSource code on Github
------------------------------------------------------------------------
+Data.VecSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Vectors
diff --git a/Data.W.html b/Data.W.html
index fc5b74e..0bf1898 100644
--- a/Data.W.html
+++ b/Data.W.html
@@ -1,5 +1,5 @@
 
-Data.WSource code on Github
------------------------------------------------------------------------
+Data.WSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- W-types
diff --git a/Data.Word64.Base.html b/Data.Word64.Base.html
index 6ee2d90..a8c4bc4 100644
--- a/Data.Word64.Base.html
+++ b/Data.Word64.Base.html
@@ -1,5 +1,5 @@
 
-Data.Word64.BaseSource code on Github
------------------------------------------------------------------------
+Data.Word64.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Machine words: basic type and conversion functions
diff --git a/Data.Word64.Properties.html b/Data.Word64.Properties.html
index 0b54f58..867ccd5 100644
--- a/Data.Word64.Properties.html
+++ b/Data.Word64.Properties.html
@@ -1,5 +1,5 @@
 
-Data.Word64.PropertiesSource code on Github
------------------------------------------------------------------------
+Data.Word64.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of operations on machine words
diff --git a/Data.Word64.html b/Data.Word64.html
index 4a0df8a..4a00ce1 100644
--- a/Data.Word64.html
+++ b/Data.Word64.html
@@ -1,5 +1,5 @@
 
-Data.Word64Source code on Github
------------------------------------------------------------------------
+Data.Word64Source code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Machine words
diff --git a/Effect.Applicative.html b/Effect.Applicative.html
index cc95350..2289160 100644
--- a/Effect.Applicative.html
+++ b/Effect.Applicative.html
@@ -1,5 +1,5 @@
 
-Effect.ApplicativeSource code on Github
------------------------------------------------------------------------
+Effect.ApplicativeSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Applicative functors
diff --git a/Effect.Choice.html b/Effect.Choice.html
index 25610fb..6810862 100644
--- a/Effect.Choice.html
+++ b/Effect.Choice.html
@@ -1,5 +1,5 @@
 
-Effect.ChoiceSource code on Github
------------------------------------------------------------------------
+Effect.ChoiceSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Type constructors giving rise to a semigroup at every type
diff --git a/Effect.Empty.html b/Effect.Empty.html
index c8618dc..5a1f03e 100644
--- a/Effect.Empty.html
+++ b/Effect.Empty.html
@@ -1,5 +1,5 @@
 
-Effect.EmptySource code on Github
------------------------------------------------------------------------
+Effect.EmptySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Empty values (e.g. [] for List, nothing for Maybe)
diff --git a/Effect.Functor.html b/Effect.Functor.html
index e9823d0..2420a83 100644
--- a/Effect.Functor.html
+++ b/Effect.Functor.html
@@ -1,5 +1,5 @@
 
-Effect.FunctorSource code on Github
------------------------------------------------------------------------
+Effect.FunctorSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Functors
diff --git a/Effect.Monad.html b/Effect.Monad.html
index ccd5221..0438f0b 100644
--- a/Effect.Monad.html
+++ b/Effect.Monad.html
@@ -1,5 +1,5 @@
 
-Effect.MonadSource code on Github
------------------------------------------------------------------------
+Effect.MonadSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Monads
diff --git a/Function.Base.html b/Function.Base.html
index e35e48c..b410be2 100644
--- a/Function.Base.html
+++ b/Function.Base.html
@@ -1,5 +1,5 @@
 
-Function.BaseSource code on Github
------------------------------------------------------------------------
+Function.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Simple combinators working solely on and with functions
diff --git a/Function.Bundles.html b/Function.Bundles.html
index 564b79a..1a79810 100644
--- a/Function.Bundles.html
+++ b/Function.Bundles.html
@@ -1,5 +1,5 @@
 
-Function.BundlesSource code on Github
------------------------------------------------------------------------
+Function.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bundles for types of functions
diff --git a/Function.Consequences.Propositional.html b/Function.Consequences.Propositional.html
index 8dadf70..9da3b27 100644
--- a/Function.Consequences.Propositional.html
+++ b/Function.Consequences.Propositional.html
@@ -1,5 +1,5 @@
 
-Function.Consequences.PropositionalSource code on Github
------------------------------------------------------------------------
+Function.Consequences.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Relationships between properties of functions where the equality
diff --git a/Function.Consequences.Setoid.html b/Function.Consequences.Setoid.html
index e1c0267..129efd1 100644
--- a/Function.Consequences.Setoid.html
+++ b/Function.Consequences.Setoid.html
@@ -1,5 +1,5 @@
 
-Function.Consequences.SetoidSource code on Github
------------------------------------------------------------------------
+Function.Consequences.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Relationships between properties of functions where the equality
diff --git a/Function.Consequences.html b/Function.Consequences.html
index 3e5afd6..7563e6c 100644
--- a/Function.Consequences.html
+++ b/Function.Consequences.html
@@ -1,5 +1,5 @@
 
-Function.ConsequencesSource code on Github
------------------------------------------------------------------------
+Function.ConsequencesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Relationships between properties of functions. See
diff --git a/Function.Construct.Composition.html b/Function.Construct.Composition.html
index 1e3f9cb..b157208 100644
--- a/Function.Construct.Composition.html
+++ b/Function.Construct.Composition.html
@@ -1,5 +1,5 @@
 
-Function.Construct.CompositionSource code on Github
------------------------------------------------------------------------
+Function.Construct.CompositionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Composition of functional properties
diff --git a/Function.Construct.Identity.html b/Function.Construct.Identity.html
index 6e8cd8d..320159a 100644
--- a/Function.Construct.Identity.html
+++ b/Function.Construct.Identity.html
@@ -1,5 +1,5 @@
 
-Function.Construct.IdentitySource code on Github
------------------------------------------------------------------------
+Function.Construct.IdentitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The identity function
diff --git a/Function.Construct.Symmetry.html b/Function.Construct.Symmetry.html
index 3cc5cbf..6a34353 100644
--- a/Function.Construct.Symmetry.html
+++ b/Function.Construct.Symmetry.html
@@ -1,5 +1,5 @@
 
-Function.Construct.SymmetrySource code on Github
------------------------------------------------------------------------
+Function.Construct.SymmetrySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some functional properties are symmetric
diff --git a/Function.Core.html b/Function.Core.html
index 99960f1..c029c84 100644
--- a/Function.Core.html
+++ b/Function.Core.html
@@ -1,5 +1,5 @@
 
-Function.CoreSource code on Github
------------------------------------------------------------------------
+Function.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core definitions for Functions
diff --git a/Function.Definitions.html b/Function.Definitions.html
index e663c15..4103289 100644
--- a/Function.Definitions.html
+++ b/Function.Definitions.html
@@ -1,5 +1,5 @@
 
-Function.DefinitionsSource code on Github
------------------------------------------------------------------------
+Function.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions for types of functions.
diff --git a/Function.Dependent.Bundles.html b/Function.Dependent.Bundles.html
index 3bc5fd1..c2d4e3c 100644
--- a/Function.Dependent.Bundles.html
+++ b/Function.Dependent.Bundles.html
@@ -1,5 +1,5 @@
 
-Function.Dependent.BundlesSource code on Github
------------------------------------------------------------------------
+Function.Dependent.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bundles for types of functions
diff --git a/Function.Indexed.Relation.Binary.Equality.html b/Function.Indexed.Relation.Binary.Equality.html
index dc4f91c..2e5beaa 100644
--- a/Function.Indexed.Relation.Binary.Equality.html
+++ b/Function.Indexed.Relation.Binary.Equality.html
@@ -1,5 +1,5 @@
 
-Function.Indexed.Relation.Binary.EqualitySource code on Github
------------------------------------------------------------------------
+Function.Indexed.Relation.Binary.EqualitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Function setoids and related constructions
diff --git a/Function.Metric.Bundles.html b/Function.Metric.Bundles.html
index d6ead1a..b52426a 100644
--- a/Function.Metric.Bundles.html
+++ b/Function.Metric.Bundles.html
@@ -1,5 +1,5 @@
 
-Function.Metric.BundlesSource code on Github
------------------------------------------------------------------------
+Function.Metric.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bundles for metrics
diff --git a/Function.Metric.Core.html b/Function.Metric.Core.html
index d38213f..215178d 100644
--- a/Function.Metric.Core.html
+++ b/Function.Metric.Core.html
@@ -1,5 +1,5 @@
 
-Function.Metric.CoreSource code on Github
------------------------------------------------------------------------
+Function.Metric.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core metric definitions
diff --git a/Function.Metric.Definitions.html b/Function.Metric.Definitions.html
index 4b5fe9a..e868b2f 100644
--- a/Function.Metric.Definitions.html
+++ b/Function.Metric.Definitions.html
@@ -1,5 +1,5 @@
 
-Function.Metric.DefinitionsSource code on Github
------------------------------------------------------------------------
+Function.Metric.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions of properties over distance functions
diff --git a/Function.Metric.Nat.Bundles.html b/Function.Metric.Nat.Bundles.html
index 58e275b..2e17f79 100644
--- a/Function.Metric.Nat.Bundles.html
+++ b/Function.Metric.Nat.Bundles.html
@@ -1,5 +1,5 @@
 
-Function.Metric.Nat.BundlesSource code on Github
------------------------------------------------------------------------
+Function.Metric.Nat.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bundles for metrics over ℕ
diff --git a/Function.Metric.Nat.Core.html b/Function.Metric.Nat.Core.html
index 98c3a26..c2a7099 100644
--- a/Function.Metric.Nat.Core.html
+++ b/Function.Metric.Nat.Core.html
@@ -1,5 +1,5 @@
 
-Function.Metric.Nat.CoreSource code on Github
------------------------------------------------------------------------
+Function.Metric.Nat.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core definitions for metrics over ℕ
diff --git a/Function.Metric.Nat.Definitions.html b/Function.Metric.Nat.Definitions.html
index f3840bd..ffb03e7 100644
--- a/Function.Metric.Nat.Definitions.html
+++ b/Function.Metric.Nat.Definitions.html
@@ -1,5 +1,5 @@
 
-Function.Metric.Nat.DefinitionsSource code on Github
------------------------------------------------------------------------
+Function.Metric.Nat.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core definitions for metrics over ℕ
diff --git a/Function.Metric.Nat.Structures.html b/Function.Metric.Nat.Structures.html
index 0299167..54f94cc 100644
--- a/Function.Metric.Nat.Structures.html
+++ b/Function.Metric.Nat.Structures.html
@@ -1,5 +1,5 @@
 
-Function.Metric.Nat.StructuresSource code on Github
------------------------------------------------------------------------
+Function.Metric.Nat.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core definitions for metrics over ℕ
diff --git a/Function.Metric.Nat.html b/Function.Metric.Nat.html
index 0594592..dbf9c7f 100644
--- a/Function.Metric.Nat.html
+++ b/Function.Metric.Nat.html
@@ -1,5 +1,5 @@
 
-Function.Metric.NatSource code on Github
------------------------------------------------------------------------
+Function.Metric.NatSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Metrics with ℕ as the codomain of the metric function
diff --git a/Function.Metric.Structures.html b/Function.Metric.Structures.html
index c133868..c832692 100644
--- a/Function.Metric.Structures.html
+++ b/Function.Metric.Structures.html
@@ -1,5 +1,5 @@
 
-Function.Metric.StructuresSource code on Github
------------------------------------------------------------------------
+Function.Metric.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some metric structures (not packed up with sets, operations, etc.)
diff --git a/Function.Nary.NonDependent.Base.html b/Function.Nary.NonDependent.Base.html
index 89d5579..05071da 100644
--- a/Function.Nary.NonDependent.Base.html
+++ b/Function.Nary.NonDependent.Base.html
@@ -1,5 +1,5 @@
 
-Function.Nary.NonDependent.BaseSource code on Github
------------------------------------------------------------------------
+Function.Nary.NonDependent.BaseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Heterogeneous N-ary Functions: basic types and operations
diff --git a/Function.Nary.NonDependent.html b/Function.Nary.NonDependent.html
index 76ab954..c530afc 100644
--- a/Function.Nary.NonDependent.html
+++ b/Function.Nary.NonDependent.html
@@ -1,5 +1,5 @@
 
-Function.Nary.NonDependentSource code on Github
------------------------------------------------------------------------
+Function.Nary.NonDependentSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Heterogeneous N-ary Functions
diff --git a/Function.Properties.Bijection.html b/Function.Properties.Bijection.html
index b617394..9a3346e 100644
--- a/Function.Properties.Bijection.html
+++ b/Function.Properties.Bijection.html
@@ -1,5 +1,5 @@
 
-Function.Properties.BijectionSource code on Github
------------------------------------------------------------------------
+Function.Properties.BijectionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some basic properties of bijections.
diff --git a/Function.Properties.Inverse.HalfAdjointEquivalence.html b/Function.Properties.Inverse.HalfAdjointEquivalence.html
index aa4643f..7d1d66d 100644
--- a/Function.Properties.Inverse.HalfAdjointEquivalence.html
+++ b/Function.Properties.Inverse.HalfAdjointEquivalence.html
@@ -1,5 +1,5 @@
 
-Function.Properties.Inverse.HalfAdjointEquivalenceSource code on Github
------------------------------------------------------------------------
+Function.Properties.Inverse.HalfAdjointEquivalenceSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Half adjoint equivalences
diff --git a/Function.Properties.Inverse.html b/Function.Properties.Inverse.html
index 79ebd51..800529e 100644
--- a/Function.Properties.Inverse.html
+++ b/Function.Properties.Inverse.html
@@ -1,5 +1,5 @@
 
-Function.Properties.InverseSource code on Github
------------------------------------------------------------------------
+Function.Properties.InverseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of inverses.
diff --git a/Function.Properties.RightInverse.html b/Function.Properties.RightInverse.html
index bebe42f..43e8ebd 100644
--- a/Function.Properties.RightInverse.html
+++ b/Function.Properties.RightInverse.html
@@ -1,5 +1,5 @@
 
-Function.Properties.RightInverseSource code on Github
------------------------------------------------------------------------
+Function.Properties.RightInverseSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of right inverses
diff --git a/Function.Properties.Surjection.html b/Function.Properties.Surjection.html
index 5cf43c9..fa4ee5b 100644
--- a/Function.Properties.Surjection.html
+++ b/Function.Properties.Surjection.html
@@ -1,5 +1,5 @@
 
-Function.Properties.SurjectionSource code on Github
------------------------------------------------------------------------
+Function.Properties.SurjectionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of surjections
diff --git a/Function.Related.Propositional.html b/Function.Related.Propositional.html
index ff89117..bbfef26 100644
--- a/Function.Related.Propositional.html
+++ b/Function.Related.Propositional.html
@@ -1,5 +1,5 @@
 
-Function.Related.PropositionalSource code on Github
------------------------------------------------------------------------
+Function.Related.PropositionalSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Relatedness for the function hierarchy
diff --git a/Function.Related.TypeIsomorphisms.html b/Function.Related.TypeIsomorphisms.html
index 0f4bcc0..aea7739 100644
--- a/Function.Related.TypeIsomorphisms.html
+++ b/Function.Related.TypeIsomorphisms.html
@@ -1,5 +1,5 @@
 
-Function.Related.TypeIsomorphismsSource code on Github
------------------------------------------------------------------------
+Function.Related.TypeIsomorphismsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Basic lemmas showing that various types are related (isomorphic or
diff --git a/Function.Strict.html b/Function.Strict.html
index a622392..ac7aca9 100644
--- a/Function.Strict.html
+++ b/Function.Strict.html
@@ -1,5 +1,5 @@
 
-Function.StrictSource code on Github
------------------------------------------------------------------------
+Function.StrictSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Strict combinators (i.e. that use call-by-value)
diff --git a/Function.Structures.Biased.html b/Function.Structures.Biased.html
index aefe8c1..41e5f45 100644
--- a/Function.Structures.Biased.html
+++ b/Function.Structures.Biased.html
@@ -1,5 +1,5 @@
 
-Function.Structures.BiasedSource code on Github
------------------------------------------------------------------------
+Function.Structures.BiasedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Ways to give instances of certain structures where some fields can
diff --git a/Function.Structures.html b/Function.Structures.html
index e4621eb..fbc794a 100644
--- a/Function.Structures.html
+++ b/Function.Structures.html
@@ -1,5 +1,5 @@
 
-Function.StructuresSource code on Github
------------------------------------------------------------------------
+Function.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Structures for types of functions
diff --git a/Function.html b/Function.html
index 8d94374..8d6175d 100644
--- a/Function.html
+++ b/Function.html
@@ -1,5 +1,5 @@
 
-FunctionSource code on Github
------------------------------------------------------------------------
+FunctionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Functions
diff --git a/Induction.Lexicographic.html b/Induction.Lexicographic.html
index 592aca9..0ebd827 100644
--- a/Induction.Lexicographic.html
+++ b/Induction.Lexicographic.html
@@ -1,5 +1,5 @@
 
-Induction.LexicographicSource code on Github
------------------------------------------------------------------------
+Induction.LexicographicSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Lexicographic induction
diff --git a/Induction.WellFounded.html b/Induction.WellFounded.html
index efde90a..c0778e2 100644
--- a/Induction.WellFounded.html
+++ b/Induction.WellFounded.html
@@ -1,5 +1,5 @@
 
-Induction.WellFoundedSource code on Github
------------------------------------------------------------------------
+Induction.WellFoundedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Well-founded induction
diff --git a/Induction.html b/Induction.html
index eeae987..689d8a3 100644
--- a/Induction.html
+++ b/Induction.html
@@ -1,5 +1,5 @@
 
-InductionSource code on Github
------------------------------------------------------------------------
+InductionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- An abstraction of various forms of recursion/induction
diff --git a/Level.html b/Level.html
index 797d5d7..e904675 100644
--- a/Level.html
+++ b/Level.html
@@ -1,5 +1,5 @@
 
-LevelSource code on Github
------------------------------------------------------------------------
+LevelSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Universe levels
diff --git a/Meta.Init.html b/Meta.Init.html
index 7e5b00d..9d49e77 100644
--- a/Meta.Init.html
+++ b/Meta.Init.html
@@ -1,5 +1,5 @@
 
-Meta.InitSource code on Github
{-# OPTIONS --safe --without-K #-}
+Meta.InitSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 module Meta.Init where
 
diff --git a/Meta.Prelude.html b/Meta.Prelude.html
index 884264c..4aaa519 100644
--- a/Meta.Prelude.html
+++ b/Meta.Prelude.html
@@ -1,5 +1,5 @@
 
-Meta.PreludeSource code on Github
{-# OPTIONS --safe --without-K #-}
+Meta.PreludeSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 module Meta.Prelude where
 
diff --git a/Reflection.AST.Abstraction.html b/Reflection.AST.Abstraction.html
index 2c67aff..a5fd848 100644
--- a/Reflection.AST.Abstraction.html
+++ b/Reflection.AST.Abstraction.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.AbstractionSource code on Github
------------------------------------------------------------------------
+Reflection.AST.AbstractionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Abstractions used in the reflection machinery
diff --git a/Reflection.AST.Argument.Information.html b/Reflection.AST.Argument.Information.html
index e24abbb..89af116 100644
--- a/Reflection.AST.Argument.Information.html
+++ b/Reflection.AST.Argument.Information.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.Argument.InformationSource code on Github
------------------------------------------------------------------------
+Reflection.AST.Argument.InformationSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Argument information used in the reflection machinery
diff --git a/Reflection.AST.Argument.Modality.html b/Reflection.AST.Argument.Modality.html
index 5451373..8f1dac4 100644
--- a/Reflection.AST.Argument.Modality.html
+++ b/Reflection.AST.Argument.Modality.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.Argument.ModalitySource code on Github
------------------------------------------------------------------------
+Reflection.AST.Argument.ModalitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Modalities used in the reflection machinery
diff --git a/Reflection.AST.Argument.Quantity.html b/Reflection.AST.Argument.Quantity.html
index 56b62cf..41dd626 100644
--- a/Reflection.AST.Argument.Quantity.html
+++ b/Reflection.AST.Argument.Quantity.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.Argument.QuantitySource code on Github
------------------------------------------------------------------------
+Reflection.AST.Argument.QuantitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Argument quantities used in the reflection machinery
diff --git a/Reflection.AST.Argument.Relevance.html b/Reflection.AST.Argument.Relevance.html
index 07e8fb9..41755c2 100644
--- a/Reflection.AST.Argument.Relevance.html
+++ b/Reflection.AST.Argument.Relevance.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.Argument.RelevanceSource code on Github
------------------------------------------------------------------------
+Reflection.AST.Argument.RelevanceSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Argument relevance used in the reflection machinery
diff --git a/Reflection.AST.Argument.Visibility.html b/Reflection.AST.Argument.Visibility.html
index 776a904..5d47d17 100644
--- a/Reflection.AST.Argument.Visibility.html
+++ b/Reflection.AST.Argument.Visibility.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.Argument.VisibilitySource code on Github
------------------------------------------------------------------------
+Reflection.AST.Argument.VisibilitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Argument visibility used in the reflection machinery
diff --git a/Reflection.AST.Argument.html b/Reflection.AST.Argument.html
index 0de3fc4..bed59eb 100644
--- a/Reflection.AST.Argument.html
+++ b/Reflection.AST.Argument.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.ArgumentSource code on Github
------------------------------------------------------------------------
+Reflection.AST.ArgumentSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Arguments used in the reflection machinery
diff --git a/Reflection.AST.Definition.html b/Reflection.AST.Definition.html
index df5e0fc..6761647 100644
--- a/Reflection.AST.Definition.html
+++ b/Reflection.AST.Definition.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.DefinitionSource code on Github
------------------------------------------------------------------------
+Reflection.AST.DefinitionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions used in the reflection machinery
diff --git a/Reflection.AST.Literal.html b/Reflection.AST.Literal.html
index d199e74..d8832e0 100644
--- a/Reflection.AST.Literal.html
+++ b/Reflection.AST.Literal.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.LiteralSource code on Github
------------------------------------------------------------------------
+Reflection.AST.LiteralSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Literals used in the reflection machinery
diff --git a/Reflection.AST.Meta.html b/Reflection.AST.Meta.html
index eb6f2fc..95b2128 100644
--- a/Reflection.AST.Meta.html
+++ b/Reflection.AST.Meta.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.MetaSource code on Github
------------------------------------------------------------------------
+Reflection.AST.MetaSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Metavariables used in the reflection machinery
diff --git a/Reflection.AST.Name.html b/Reflection.AST.Name.html
index 7400c3f..6189298 100644
--- a/Reflection.AST.Name.html
+++ b/Reflection.AST.Name.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.NameSource code on Github
------------------------------------------------------------------------
+Reflection.AST.NameSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Names used in the reflection machinery
diff --git a/Reflection.AST.Pattern.html b/Reflection.AST.Pattern.html
index c6fc88d..e24244b 100644
--- a/Reflection.AST.Pattern.html
+++ b/Reflection.AST.Pattern.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.PatternSource code on Github
------------------------------------------------------------------------
+Reflection.AST.PatternSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Patterns used in the reflection machinery
diff --git a/Reflection.AST.Show.html b/Reflection.AST.Show.html
index 2814c61..08cbfe6 100644
--- a/Reflection.AST.Show.html
+++ b/Reflection.AST.Show.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.ShowSource code on Github
------------------------------------------------------------------------
+Reflection.AST.ShowSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Converting reflection machinery to strings
diff --git a/Reflection.AST.Term.html b/Reflection.AST.Term.html
index b998202..279c968 100644
--- a/Reflection.AST.Term.html
+++ b/Reflection.AST.Term.html
@@ -1,5 +1,5 @@
 
-Reflection.AST.TermSource code on Github
------------------------------------------------------------------------
+Reflection.AST.TermSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Terms used in the reflection machinery
diff --git a/Reflection.AST.html b/Reflection.AST.html
index 51a5290..6edb5d9 100644
--- a/Reflection.AST.html
+++ b/Reflection.AST.html
@@ -1,5 +1,5 @@
 
-Reflection.ASTSource code on Github
------------------------------------------------------------------------
+Reflection.ASTSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The reflected abstract syntax tree
diff --git a/Reflection.AlphaEquality.html b/Reflection.AlphaEquality.html
index dd331be..0f79d40 100644
--- a/Reflection.AlphaEquality.html
+++ b/Reflection.AlphaEquality.html
@@ -1,5 +1,5 @@
 
-Reflection.AlphaEqualitySource code on Github
------------------------------------------------------------------------
+Reflection.AlphaEqualitySource code on Github
------------------------------------------------------------------------
 -- Alpha equality
 --
 -- Taken almost verbatim from the Agda stdlib
diff --git a/Reflection.AntiUnification.html b/Reflection.AntiUnification.html
index bf57ee7..e041ead 100644
--- a/Reflection.AntiUnification.html
+++ b/Reflection.AntiUnification.html
@@ -1,5 +1,5 @@
 
-Reflection.AntiUnificationSource code on Github
{-# OPTIONS --safe --without-K #-}
+Reflection.AntiUnificationSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 ----------------------------------------------------------------------
 -- Anti-Unification
diff --git a/Reflection.Debug.html b/Reflection.Debug.html
index 993eab8..79ca667 100644
--- a/Reflection.Debug.html
+++ b/Reflection.Debug.html
@@ -1,5 +1,5 @@
 
-Reflection.DebugSource code on Github
{-# OPTIONS --safe --without-K #-}
+Reflection.DebugSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 module Reflection.Debug where
 
@@ -34,89 +34,92 @@
   IsErrorPart-Name : IsErrorPart Name
   IsErrorPart-Name .toErrorPart = ErrorPart.nameErr
 
-  IsErrorPart-Clause : IsErrorPart Clause
-  IsErrorPart-Clause .toErrorPart c = ErrorPart.termErr (pat-lam [ c ] [])
+  IsErrorPart-Pattern : IsErrorPart Pattern
+  IsErrorPart-Pattern .toErrorPart = ErrorPart.pattErr
 
-  IsErrorPart-ListClause : IsErrorPart (List Clause)
-  IsErrorPart-ListClause .toErrorPart cs = ErrorPart.termErr (pat-lam cs [])
+  IsErrorPart-Clause : IsErrorPart Clause
+  IsErrorPart-Clause .toErrorPart c = ErrorPart.termErr (pat-lam [ c ] [])
 
-infixr 5 _∷ᵈ_ _++ᵈ_
-_∷ᵈ_ : A → ⦃ _ : IsErrorPart A ⦄ → List ErrorPart → List ErrorPart
-e ∷ᵈ es = toErrorPart e ∷ es
+  IsErrorPart-ListClause : IsErrorPart (List Clause)
+  IsErrorPart-ListClause .toErrorPart cs = ErrorPart.termErr (pat-lam cs [])
 
-_++ᵈ_ : List A → ⦃ _ : IsErrorPart A ⦄ → List ErrorPart → List ErrorPart
-es ++ᵈ es' = map toErrorPart es ++ es'
+infixr 5 _∷ᵈ_ _++ᵈ_
+_∷ᵈ_ : A → ⦃ _ : IsErrorPart A ⦄ → List ErrorPart → List ErrorPart
+e ∷ᵈ es = toErrorPart e ∷ es
 
-_ᵈ : ⦃ _ : IsErrorPart A ⦄ → List A → List ErrorPart
-_ᵈ = map toErrorPart
+_++ᵈ_ : List A → ⦃ _ : IsErrorPart A ⦄ → List ErrorPart → List ErrorPart
+es ++ᵈ es' = map toErrorPart es ++ es'
 
-data DebugSelection : Set where
-  FullPath : DebugSelection
-  Last     : DebugSelection
-  All      : DebugSelection
-  Custom   : (List String → String) → DebugSelection
+_ᵈ : ⦃ _ : IsErrorPart A ⦄ → List A → List ErrorPart
+_ᵈ = map toErrorPart
 
--- If All is selected, this pragma shows all debug info
--- {-# OPTIONS -v allTactics:100 #-}
+data DebugSelection : Set where
+  FullPath : DebugSelection
+  Last     : DebugSelection
+  All      : DebugSelection
+  Custom   : (List String → String) → DebugSelection
 
-Filter : Set
-Filter = List String → Bool
+-- If All is selected, this pragma shows all debug info
+-- {-# OPTIONS -v allTactics:100 #-}
 
-module Filter where
-  open import Algebra.Lattice
-  open import Data.Bool.Properties
-  import Algebra.Function
+Filter : Set
+Filter = List String → Bool
 
-  Filter-Alg : BooleanAlgebra _ _
-  Filter-Alg = Algebra.Function.hom (List String) ∨-∧-booleanAlgebra
+module Filter where
+  open import Algebra.Lattice
+  open import Data.Bool.Properties
+  import Algebra.Function
 
-  open BooleanAlgebra Filter-Alg public
+  Filter-Alg : BooleanAlgebra _ _
+  Filter-Alg = Algebra.Function.hom (List String) ∨-∧-booleanAlgebra
 
-  private
-    _≣_ : String → String → Bool
-    s ≣ s' = ⌊ s S.≟ s' ⌋
+  open BooleanAlgebra Filter-Alg public
 
-  contains : String → Filter
-  contains s l = foldl (λ acc s' → acc B.∨ s ≣ s') false l
+  private
+    _≣_ : String → String → Bool
+    s ≣ s' = ⌊ s S.≟ s' ⌋
 
-  noneOf : List String → Filter
-  noneOf [] = ⊤
-  noneOf (x ∷ l) = ¬ contains x ∧ noneOf l
+  contains : String → Filter
+  contains s l = foldl (λ acc s' → acc B.∨ s ≣ s') false l
 
-  endsWith : String → Filter
-  endsWith s l with last l
-  ... | just x  = s ≣ x
-  ... | nothing = false
+  noneOf : List String → Filter
+  noneOf [] = ⊤
+  noneOf (x ∷ l) = ¬ contains x ∧ noneOf l
 
-  beginsWith : String → Filter
-  beginsWith s l with head l
-  ... | just x  = s ≣ x
-  ... | nothing = false
+  endsWith : String → Filter
+  endsWith s l with last l
+  ... | just x  = s ≣ x
+  ... | nothing = false
 
-record DebugOptions : Set where
-  field
-    path      : List String
-    selection : DebugSelection
-    filter    : Filter
-    level     : ℕ
-    prefix    : Char
+  beginsWith : String → Filter
+  beginsWith s l with head l
+  ... | just x  = s ≣ x
+  ... | nothing = false
 
-defaultDebugOptions : DebugOptions
-defaultDebugOptions = record
-  { path = []; selection = All; filter = Filter.⊤; level = 100; prefix = '|' }
+record DebugOptions : Set where
+  field
+    path      : List String
+    selection : DebugSelection
+    filter    : Filter
+    level     : ℕ
+    prefix    : Char
 
-specializeDebugOptions : DebugOptions → DebugOptions → DebugOptions
-specializeDebugOptions record { path = path₁ } opts@record { path = path₂ } =
-  record opts { path = path₁ ++ path₂ }
+defaultDebugOptions : DebugOptions
+defaultDebugOptions = record
+  { path = []; selection = All; filter = Filter.⊤; level = 100; prefix = '|' }
 
-debugOptionsPath : DebugOptions → String
-debugOptionsPath record { path = path ; selection = FullPath } = S.intersperse "/" path
-debugOptionsPath record { path = path ; selection = Last } with last path
-... | just x  = x
-... | nothing = ""
-debugOptionsPath record { path = path ; selection = All } = "allTactics"
-debugOptionsPath record { path = path ; selection = Custom f } = f path
+specializeDebugOptions : DebugOptions → DebugOptions → DebugOptions
+specializeDebugOptions record { path = path₁ } opts@record { path = path₂ } =
+  record opts { path = path₁ ++ path₂ }
 
-debugPrintPrefix : DebugOptions → ErrorPart
-debugPrintPrefix o = let open DebugOptions o in strErr (S.replicate (length path) prefix)
+debugOptionsPath : DebugOptions → String
+debugOptionsPath record { path = path ; selection = FullPath } = S.intersperse "/" path
+debugOptionsPath record { path = path ; selection = Last } with last path
+... | just x  = x
+... | nothing = ""
+debugOptionsPath record { path = path ; selection = All } = "allTactics"
+debugOptionsPath record { path = path ; selection = Custom f } = f path
+
+debugPrintPrefix : DebugOptions → ErrorPart
+debugPrintPrefix o = let open DebugOptions o in strErr (S.replicate (length path) prefix)
 

\ No newline at end of file
diff --git a/Reflection.Syntax.html b/Reflection.Syntax.html
index 4fcf36c..8b7a757 100644
--- a/Reflection.Syntax.html
+++ b/Reflection.Syntax.html
@@ -1,5 +1,5 @@
 
-Reflection.SyntaxSource code on Github
{-# OPTIONS --safe --without-K #-}
+Reflection.SyntaxSource code on Github
{-# OPTIONS --safe --without-K #-}
 
 module Reflection.Syntax where
 
diff --git a/Reflection.TCI.html b/Reflection.TCI.html
index c5a2362..f8b6aa0 100644
--- a/Reflection.TCI.html
+++ b/Reflection.TCI.html
@@ -1,5 +1,5 @@
 
-Reflection.TCISource code on Github
{-# OPTIONS --safe --without-K #-}
+Reflection.TCISource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- Improved TC
 --------------------------------------------------------------------------------
@@ -25,31 +25,31 @@
                  A B C D : Set a
 
 TC : Set a → Set a
-TC = ReaderT TCEnv R.TC
+TC = ReaderT TCEnv R.TC
 
 Monad-TC : Monad TC
 Monad-TC = Monad-ReaderT ⦃ Class.Monad.Monad-TC ⦄
 
-MonadReader-TC : MonadReader TCEnv TC ⦃ Monad-TC ⦄
+MonadReader-TC : MonadReader TCEnv TC ⦃ Monad-TC ⦄
 MonadReader-TC = MonadReader-ReaderT ⦃ Class.Monad.Monad-TC ⦄
 
 MonadError-TC : MonadError (List ErrorPart) TC
 MonadError-TC = MonadError-ReaderT ⦃ Class.Monad.Monad-TC ⦄ ⦃ Class.MonadError.MonadError-TC ⦄
 
 applyReductionOptions : TC A → TC A
-applyReductionOptions x r@record { reduction = onlyReduce red } = R'.withReduceDefs (true ,  red) (x r)
-applyReductionOptions x r@record { reduction = dontReduce red } = R'.withReduceDefs (false , red) (x r)
+applyReductionOptions x r@record { reduction = onlyReduce red } = R'.withReduceDefs (true ,  red) (x r)
+applyReductionOptions x r@record { reduction = dontReduce red } = R'.withReduceDefs (false , red) (x r)
 
 applyNormalisation : TC A → TC A
-applyNormalisation x r@record { normalisation = n } = R.withNormalisation n (applyReductionOptions x r)
+applyNormalisation x r@record { normalisation = n } = R.withNormalisation n (applyReductionOptions x r)
 
 applyReconstruction : TC A → TC A
-applyReconstruction x r@record { reconstruction = false } = x r
-applyReconstruction x r@record { reconstruction = true  } = R'.withReconstructed true (x r)
+applyReconstruction x r@record { reconstruction = false } = x r
+applyReconstruction x r@record { reconstruction = true  } = R'.withReconstructed true (x r)
 
 applyNoConstraints : TC A → TC A
-applyNoConstraints x r@record { noConstraints = false } = x r
-applyNoConstraints x r@record { noConstraints = true  } = R'.noConstraints (x r)
+applyNoConstraints x r@record { noConstraints = false } = x r
+applyNoConstraints x r@record { noConstraints = true  } = R'.noConstraints (x r)
 
 applyExtContext : Telescope → R.TC A → R.TC A
 applyExtContext [] x       = x
@@ -57,7 +57,7 @@
 
 private
   liftTC : R.TC A → TC A
-  liftTC x = λ r → applyExtContext (r .TCEnv.localContext) x
+  liftTC x = λ r → applyExtContext (r .TCEnv.localContext) x
 
   liftTC1 : (A → R.TC B) → A → TC B
   liftTC1 f a = liftTC (f a)
@@ -132,6 +132,6 @@
   getInstances      : Meta → TC (List Term)
   getInstances      = liftTC1 R'.getInstances
 
-MonadTC-TCI : MonadTC TC ⦃ Monad-TC ⦄ ⦃ MonadError-TC ⦄
+MonadTC-TCI : MonadTC TC ⦃ Monad-TC ⦄ ⦃ MonadError-TC ⦄
 MonadTC-TCI = record { MonadTCI }
 

\ No newline at end of file
diff --git a/Reflection.TCM.Format.html b/Reflection.TCM.Format.html
index c35a291..5812476 100644
--- a/Reflection.TCM.Format.html
+++ b/Reflection.TCM.Format.html
@@ -1,5 +1,5 @@
 
-Reflection.TCM.FormatSource code on Github
------------------------------------------------------------------------
+Reflection.TCM.FormatSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Printf-style versions of typeError and debugPrint
diff --git a/Reflection.TCM.Syntax.html b/Reflection.TCM.Syntax.html
index 0317a76..9dafdb2 100644
--- a/Reflection.TCM.Syntax.html
+++ b/Reflection.TCM.Syntax.html
@@ -1,5 +1,5 @@
 
-Reflection.TCM.SyntaxSource code on Github
------------------------------------------------------------------------
+Reflection.TCM.SyntaxSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Monad syntax for the TC monad
diff --git a/Reflection.TCM.html b/Reflection.TCM.html
index 8c72c05..3253c0b 100644
--- a/Reflection.TCM.html
+++ b/Reflection.TCM.html
@@ -1,5 +1,5 @@
 
-Reflection.TCMSource code on Github
------------------------------------------------------------------------
+Reflection.TCMSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The TC (Type Checking) monad
diff --git a/Reflection.Tactic.html b/Reflection.Tactic.html
index c79acb2..6701117 100644
--- a/Reflection.Tactic.html
+++ b/Reflection.Tactic.html
@@ -1,5 +1,5 @@
 
-Reflection.TacticSource code on Github
{-# OPTIONS --safe --without-K #-}
+Reflection.TacticSource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- Types & functions for interacting with tactics/metaprograms
 --------------------------------------------------------------------------------
@@ -12,7 +12,7 @@
 open import Meta.Prelude
 open import Meta.Init
 
-open MonadTC ⦃...⦄
+open MonadTC ⦃...⦄
 
 private variable
   a : Level
@@ -24,27 +24,27 @@
 ITactic : Set
 ITactic = TC ⊤
 
-initTacEnv : (TCEnv → TCEnv) → ITactic → Tactic
-initTacEnv f tac goal = (initTCEnvWithGoal goal) R.>>= tac ∘ f
+initTacEnv : (TCEnv → TCEnv) → ITactic → Tactic
+initTacEnv f tac goal = (initTCEnvWithGoal goal) R.>>= tac ∘ f
 
-initTacOpts : ITactic → TCOptions → Tactic
-initTacOpts tac opts = initTacEnv (λ env → record env { options = opts }) tac
+initTacOpts : ITactic → TCOptions → Tactic
+initTacOpts tac opts = initTacEnv (λ env → record env { options = opts }) tac
 
-module _ ⦃ opts : TCOptions ⦄ where
+module _ ⦃ opts : TCOptions ⦄ where
 
   initTac : ITactic → Tactic
   initTac tac = initTacOpts tac opts
 
   initUnquoteWithGoal : Term → TC ⊤ → UnquoteDecl
-  initUnquoteWithGoal g unq = (initTCEnvWithGoal g) R.>>= unq
-                            ∘ (λ env → record env { options = opts })
+  initUnquoteWithGoal g unq = (initTCEnvWithGoal g) R.>>= unq
+                            ∘ (λ env → record env { options = opts })
 
   initUnquote : TC ⊤ → UnquoteDecl
   initUnquote unq = initUnquoteWithGoal unknown unq
 
   macro
     byTC : TC A → Tactic
-    byTC comp = initTac ((comp >>= quoteTC) >>= unifyWithGoal)
+    byTC comp = initTac ((comp >>= quoteTC) >>= unifyWithGoal)
 
     by : ITactic → Tactic
     by = initTac
diff --git a/Reflection.Utils.Debug.html b/Reflection.Utils.Debug.html
index 4470492..86364f5 100644
--- a/Reflection.Utils.Debug.html
+++ b/Reflection.Utils.Debug.html
@@ -1,5 +1,5 @@
 
-Reflection.Utils.DebugSource code on Github
-------------------------------------------------
+Reflection.Utils.DebugSource code on Github
-------------------------------------------------
 -- ** Errors, debugging
 
 {-# OPTIONS --safe --without-K #-}
diff --git a/Reflection.Utils.TCI.html b/Reflection.Utils.TCI.html
index 24d0993..f80ceaa 100644
--- a/Reflection.Utils.TCI.html
+++ b/Reflection.Utils.TCI.html
@@ -1,5 +1,5 @@
 
-Reflection.Utils.TCISource code on Github
{-# OPTIONS --safe --without-K #-}
+Reflection.Utils.TCISource code on Github
{-# OPTIONS --safe --without-K #-}
 
 open import Meta.Prelude
 open import Meta.Init
@@ -11,7 +11,7 @@
 
 module Reflection.Utils.TCI
   {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄
-  ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄ where
+  ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄ where
 
 import Data.Sum
 open import Data.List using (map; zipWith)
@@ -30,18 +30,18 @@
 instance _ = Functor-M
 
 fresh-level : M Level
-fresh-level = newMeta (quote Level ∙) >>= unquoteTC
+fresh-level = newMeta (quote Level ∙) >>= unquoteTC
 
 withHole : Type → (Hole → M ⊤) → M Hole
 withHole ty k = do
-  hole′ ← newMeta ty
+  hole′ ← newMeta ty
   k hole′
   return hole′
 
 apply : Type → Term → List (Arg Term) → M (Type × Term)
 apply A t []       = return (A , t)
 apply A t (a ∷ as) = do
-  A ← reduce A
+  A ← reduce A
   A , t ← apply₁ A t a
   apply A t as
   where
@@ -49,26 +49,26 @@
     apply₁ (pi (arg i₁@(arg-info k _) A) B) t₁ (arg i₂ t₂) = do
       a ← fresh-level
       b ← fresh-level
-      A ← unquoteTC {A = Set a} A
-      B ← unquoteTC {A = A → Set b} (lam visible B)
-      t₂ ← unquoteTC {A = A} t₂
-      Bt₂ ← quoteTC (B t₂)
+      A ← unquoteTC {A = Set a} A
+      B ← unquoteTC {A = A → Set b} (lam visible B)
+      t₂ ← unquoteTC {A = A} t₂
+      Bt₂ ← quoteTC (B t₂)
       case k of λ where
         visible → do
-          t₁ ← unquoteTC {A = ∀ (x : A) → B x} t₁
-          Bt₂ ,_ <$> quoteTC (t₁ t₂)
+          t₁ ← unquoteTC {A = ∀ (x : A) → B x} t₁
+          Bt₂ ,_ <$> quoteTC (t₁ t₂)
         hidden → do
-          t₁ ← unquoteTC {A = ∀ {x : A} → B x} t₁
-          Bt₂ ,_ <$> quoteTC (t₁ {x = t₂})
+          t₁ ← unquoteTC {A = ∀ {x : A} → B x} t₁
+          Bt₂ ,_ <$> quoteTC (t₁ {x = t₂})
         instance′ → do
-          t₁ ← unquoteTC {A = ∀ ⦃ x : A ⦄ → B x} t₁
-          Bt₂ ,_ <$> quoteTC (t₁ ⦃ x = t₂ ⦄)
-    apply₁ (meta x _) _ _ = blockOnMeta x
-    apply₁ A          _ _ = error1 "apply: not a Π-type"
+          t₁ ← unquoteTC {A = ∀ ⦃ x : A ⦄ → B x} t₁
+          Bt₂ ,_ <$> quoteTC (t₁ ⦃ x = t₂ ⦄)
+    apply₁ (meta x _) _ _ = blockOnMeta x
+    apply₁ A          _ _ = error1 "apply: not a Π-type"
 
 _-∙-_ : Term → Term → M Term
 f -∙- x = do
-  ty ← inferType f
+  ty ← inferType f
   proj₂ <$> apply ty f [ vArg x ]
 
 _-∗-_ : Term → List Term → M Term
@@ -76,7 +76,7 @@
 f -∗- (x ∷ xs) = f -∙- x >>= _-∗- xs
 
 instantiate : Hole → M Term
-instantiate = reduce >=> normalise
+instantiate = reduce >=> normalise
 
 ensureNoMetas : Term → M ⊤
 ensureNoMetas = λ where
@@ -89,7 +89,7 @@
   (agda-sort s) → noMetaSort s
   (lit l) → return _
   -- (meta x _) → errorP "meta found!"
-  (meta x _) → blockOnMeta x
+  (meta x _) → blockOnMeta x
   unknown → return _
    where
     noMetaArg : Arg Term → M ⊤
@@ -116,38 +116,38 @@
 
 module NewMeta where
   unifyStrict : THole → Term → M ⊤
-  unifyStrict (hole , ty) x = withAppendDebugPath "unifyStrict" do
-    debugLog (hole ∷ᵈ " :=? " ∷ᵈ x ∷ᵈ [])
-    m ← newMeta ty
-    noConstraints $ unify m x >> unify hole m
-    debugLog (hole ∷ᵈ " :=  " ∷ᵈ x ∷ᵈ [])
+  unifyStrict (hole , ty) x = withAppendDebugPath "unifyStrict" do
+    debugLog (hole ∷ᵈ " :=? " ∷ᵈ x ∷ᵈ [])
+    m ← newMeta ty
+    noConstraints $ unify m x >> unify hole m
+    debugLog (hole ∷ᵈ " :=  " ∷ᵈ x ∷ᵈ [])
 
 printTerm : String → Term → M ⊤
 printTerm s t = do
-  ty ← inferType t
-  debugLog
-    ( s ∷ᵈ ": {"
-    ∷ᵈ ty
-    ∷ᵈ " ∋ "
-    ∷ᵈ t
-    ∷ᵈ "}\n"
-    ∷ᵈ [])
+  ty ← inferType t
+  debugLog
+    ( s ∷ᵈ ": {"
+    ∷ᵈ ty
+    ∷ᵈ " ∋ "
+    ∷ᵈ t
+    ∷ᵈ "}\n"
+    ∷ᵈ [])
 
 module NoMeta where
   unifyStrict : THole → Term → M ⊤
-  unifyStrict (hole , ty) x = withAppendDebugPath "unifyStrictNoMeta" do
+  unifyStrict (hole , ty) x = withAppendDebugPath "unifyStrictNoMeta" do
     -- unify hole x
     -- instantiate hole >>= ensureNoMetas
 
-    debugLog ("———————————————————————————————————————\nx" ∷ᵈ x ∷ᵈ [])
-    unify hole x
-    hole ← normalise hole
+    debugLog ("———————————————————————————————————————\nx" ∷ᵈ x ∷ᵈ [])
+    unify hole x
+    hole ← normalise hole
     printTerm "hole′" hole
     -- (x ∷ hole ∷ []) ← mapM instantiate (x ∷ hole ∷ [])
     --   where _ → _IMPOSSIBLE_
     -- printTerm "x′" x
     ensureNoMetas hole
-    debugLog1 "No metas found :)\n"
+    debugLog1 "No metas found :)\n"
 
 open NewMeta public
 -- open NoMeta public
@@ -156,21 +156,21 @@
 
 unifyStricts : THole → List Term → M ⊤
 unifyStricts ht = NE.foldl₁ (λ x y → catch x (λ _ → y))
-                ∘ (NE._∷ʳ error1 "∅")
+                ∘ (NE._∷ʳ error1 "∅")
                 ∘ map ({-noConstraints ∘ -}unifyStrict ht)
 
 compatible? : Type → Type → M Bool
 compatible? ty ty′ = do
   -- print $ show ty ◇ " ≈? " ◇ show ty′
-  b ← runSpeculative $ (_, false) <$>
-    catch (unify (varsToUnknown ty) (varsToUnknown ty′) >> return true)
+  b ← runSpeculative $ (_, false) <$>
+    catch (unify (varsToUnknown ty) (varsToUnknown ty′) >> return true)
           (λ _ → return false)
   -- print $ "  ——→ " ◇ show b
   return b
 
 logTelescope : List (Maybe String × Arg Type) → M ⊤
-logTelescope l = withAppendDebugPath "context" do
-  catch (helper (length l) l) (λ _ → debugLog1 "Error while printing the context!")
+logTelescope l = withAppendDebugPath "context" do
+  catch (helper (length l) l) (λ _ → debugLog1 "Error while printing the context!")
   where
     helper : ℕ → List (Maybe String × Arg Type) → M ⊤
     helper n [] = return _
@@ -179,124 +179,132 @@
         nothing   → "?"
         (just "") → "_"
         (just x)  → x
-      debugLog ("  " ∷ᵈ name ∷ᵈ " : "  ∷ᵈ mapVars (_∸ (n ∸ (1 + length l))) t ∷ᵈ [])
-      extendContext (name , ty) $ helper n l
+      debugLog ("  " ∷ᵈ name ∷ᵈ " : "  ∷ᵈ mapVars (_∸ (n ∸ (1 + length l))) t ∷ᵈ [])
+      extendContext (name , ty) $ helper n l
 
 logContext : Telescope → M ⊤
-logContext l = withAppendDebugPath "context" do
-  debugLog1 "Context:"
-  catch (helper (length l) l) (λ _ → debugLog1 "Error while printing the context!")
+logContext l = withAppendDebugPath "context" do
+  debugLog1 "Context:"
+  catch (helper (length l) l) (λ _ → debugLog1 "Error while printing the context!")
   catch (do
-    goalTy ← goalTy
-    debugLog ("  ⊢ " ∷ᵈ goalTy ∷ᵈ []))
+    goalTy ← goalTy
+    debugLog ("  ⊢ " ∷ᵈ goalTy ∷ᵈ []))
     λ _ → do
-      inj₁ t ← reader TCEnv.goal
-        where _ → error1 "Bug in logContext!"
-      debugLog ("Error while infering the goal type! Goal: " ∷ᵈ t ∷ᵈ [])
+      inj₁ t ← reader TCEnv.goal
+        where _ → error1 "Bug in logContext!"
+      debugLog ("Error while infering the goal type! Goal: " ∷ᵈ t ∷ᵈ [])
   where
     helper : ℕ → Telescope → M ⊤
     helper n [] = return _
     helper n ((_ , arg _ t) ∷ l) = do
       helper n l
-      debugLog ("  " ∷ᵈ ♯ (n ∸ (length l + 1)) ∷ᵈ " : " ∷ᵈ mapVars (_+ (n ∸ length l)) t ∷ᵈ [])
+      debugLog ("  " ∷ᵈ ♯ (n ∸ (length l + 1)) ∷ᵈ " : " ∷ᵈ mapVars (_+ (n ∸ length l)) t ∷ᵈ [])
 
 logCurrentContext : M ⊤
-logCurrentContext = markDontFail "logCurrentContext" (logContext =<< getContext)
+logCurrentContext = markDontFail "logCurrentContext" (logContext =<< getContext)
 
 inDebugPath : String → M A → M A
-inDebugPath path x = withAppendDebugPath path do
-  debugLog (("*****" <+> path <+> "*****") ∷ᵈ [])
+inDebugPath path x = withAppendDebugPath path do
+  debugLog (("*****" <+> path <+> "*****") ∷ᵈ [])
   -- This throws an internal error if the macro is run in a type signature
   -- (Agda issue #7187)
   -- logCurrentContext
   x
 
 viewAndReduceTy : Type → M TypeView
-viewAndReduceTy ty = helper ty =<< (length ∘ proj₁ ∘ viewTy) <$> normalise ty
+viewAndReduceTy ty = helper ty =<< (length ∘ proj₁ ∘ viewTy) <$> normalise ty
   where
     helper : Type → ℕ → M TypeView
     helper ty    zero = return $ viewTy ty
     helper ty (suc k) with viewTy ty
-    ... | (tel , ty') = extendContext' (map (λ where (abs s t) → s , t) tel) $ do
-      rTy ← reduce ty'
+    ... | (tel , ty') = extendContext' (map (λ where (abs s t) → s , t) tel) $ do
+      rTy ← reduce ty'
       (tel' , rTy') ← helper rTy k
       return (tel ++ tel' , rTy')
 
 getType' : Name → M TypeView
-getType' n = viewAndReduceTy =<< getType n
-
-getDataDef : Name → M DataDef
-getDataDef n = inDebugPath "getDataDef" do
-  debugLog ("Find details for datatype: " ∷ᵈ n ∷ᵈ [])
-  (data-type pars cs) ← getDefinition n
-    where _ → error1 "Not a data definition!"
-  debugLogᵐ ("Constructor names: " ∷ᵈᵐ cs ᵛ ∷ᵈᵐ []ᵐ)
-  cs' ← traverse ⦃ Functor-List ⦄ (λ n → (n ,_) <$> getType' n) cs
-  debugLogᵐ ("Result: " ∷ᵈᵐ cs' ᵛⁿ ∷ᵈᵐ []ᵐ)
-  args ← proj₁ <$> getType' n
-  return record { name = n ; constructors = cs' ; params = take pars args ; indices = drop pars args }
-
-getRecordDef : Name → M RecordDef
-getRecordDef n = do
-  (record-type c fs) ← getDefinition n
-    where _ → error1 "Not a record definition!"
-  args ← proj₁ <$> getType' n
-  return (record { name = c ; fields = fs ; params = args })
-
-getDataOrRecordDef : Name → M (DataDef ⊎ RecordDef)
-getDataOrRecordDef n =
-  catch (inj₁ <$> getDataDef n)
-    λ _ → catch (inj₂ <$> getRecordDef n)
-    λ _ → error1 "Neither a data not a record definition!"
-
-getParams : Name → M (List (Abs (Arg Type)))
-getParams n = Data.Sum.[ DataDef.params , RecordDef.params ] <$> getDataOrRecordDef n
-
-getParamsAndIndices : Name → M (List (Abs (Arg Type)))
-getParamsAndIndices n =
-  Data.Sum.[ (λ d → DataDef.params d ++ DataDef.indices d) , RecordDef.params ] <$> getDataOrRecordDef n
-
-getFuel : String → M ℕ
-getFuel s = do
-  fuels ← reader (λ where record { options = record { fuel = f } } → f )
-  case lookupᵇ (λ s s' → ⌊ s ≟ s' ⌋) fuels s of λ where
-    nothing  → error1 ("Key" <+> s <+> "doesn't exist in the fuels map")
-    (just f) → return f
-
-isSort : Term → M Bool
-isSort t = do
-  (agda-sort _) ← normalise t
-    where _ → return false
-  return true
-
-isNArySort : ℕ → Term → M Bool
-isNArySort n t = do
-  (tel , ty) ← viewAndReduceTy t
-  b ← isSort ty
-  return (⌊ (length tel) ≟ n ⌋ ∧ b)
-
-isDefT : Name → Term → M Bool
-isDefT n t = do
-  (def n' _) ← normalise t
-    where _ → return false
-  return ⌊ n ≟ n' ⌋
-
--- run a computation that returns a term, resetting the TC state but
--- ensuring that the term doesn't contain any metavariables
-withSafeReset : M Term → M Term
-withSafeReset x = runAndReset $ do
-  t ← x
-  let m = findMetas t
-  if null m
-    then return t
-    else do
-      debugLogᵐ ("Remaining metavariables:" ∷ᵈᵐ m ᵛⁿ ∷ᵈᵐ []ᵐ)
-      debugLog ("In term: " ∷ᵈ t ∷ᵈ [])
-      error1 "Unsolved metavariables remaining in withSafeReset!"
-
--- apply a list of terms to a name, picking the correct constructor & visibility
-applyWithVisibility : Name → List Term → M Term
-applyWithVisibility n l = do
-  (argTys , _) ← getType' n
-  nameConstr n (zipWith (λ where (abs _ (arg i _)) → arg i) argTys l)
+getType' n = viewAndReduceTy =<< getType n
+
+getTypeDB : ℕ → M TypeView
+getTypeDB n = viewAndReduceTy =<< inferType (♯ n)
+
+getDataDef : Name → M DataDef
+getDataDef n = inDebugPath "getDataDef" do
+  debugLog ("Find details for datatype: " ∷ᵈ n ∷ᵈ [])
+  (data-type pars cs) ← getDefinition n
+    where _ → error1 "Not a data definition!"
+  debugLogᵐ ("Constructor names: " ∷ᵈᵐ cs ᵛ ∷ᵈᵐ []ᵐ)
+  cs' ← traverse ⦃ Functor-List ⦄ (λ n → (n ,_) <$> getType' n) cs
+  debugLogᵐ ("Result: " ∷ᵈᵐ cs' ᵛⁿ ∷ᵈᵐ []ᵐ)
+  args ← proj₁ <$> getType' n
+  return record { name = n ; constructors = cs' ; params = take pars args ; indices = drop pars args }
+
+getRecordDef : Name → M RecordDef
+getRecordDef n = do
+  (record-type c fs) ← getDefinition n
+    where _ → error1 "Not a record definition!"
+  args ← proj₁ <$> getType' n
+  return (record { name = c ; fields = fs ; params = args })
+
+getDataOrRecordDef : Name → M (DataDef ⊎ RecordDef)
+getDataOrRecordDef n =
+  catch (inj₁ <$> getDataDef n)
+    λ _ → catch (inj₂ <$> getRecordDef n)
+    λ _ → error1 "Neither a data not a record definition!"
+
+getParams : Name → M (List (Abs (Arg Type)))
+getParams n = Data.Sum.[ DataDef.params , RecordDef.params ] <$> getDataOrRecordDef n
+
+getParamsAndIndices : Name → M (List (Abs (Arg Type)))
+getParamsAndIndices n =
+  Data.Sum.[ (λ d → DataDef.params d ++ DataDef.indices d) , RecordDef.params ] <$> getDataOrRecordDef n
+
+getFuel : String → M ℕ
+getFuel s = do
+  fuels ← reader (λ where record { options = record { fuel = f } } → f )
+  case lookupᵇ (λ s s' → ⌊ s ≟ s' ⌋) fuels s of λ where
+    nothing  → error1 ("Key" <+> s <+> "doesn't exist in the fuels map")
+    (just f) → return f
+
+isSort : Term → M Bool
+isSort t = do
+  (agda-sort _) ← normalise t
+    where _ → return false
+  return true
+
+isNArySort : Term → M (Bool × ℕ)
+isNArySort t = do
+  (tel , ty) ← viewAndReduceTy t
+  b ← isSort ty
+  return (b , length tel)
+
+isDefT : Name → Term → M Bool
+isDefT n t = do
+  (def n' _) ← normalise t
+    where _ → return false
+  return ⌊ n ≟ n' ⌋
+
+-- run a computation that returns a term, resetting the TC state but
+-- ensuring that the term doesn't contain any metavariables
+withSafeReset : M Term → M Term
+withSafeReset x = runAndReset $ do
+  t ← x
+  let m = findMetas t
+  if null m
+    then return t
+    else do
+      debugLogᵐ ("Remaining metavariables:" ∷ᵈᵐ m ᵛⁿ ∷ᵈᵐ []ᵐ)
+      debugLog ("In term: " ∷ᵈ t ∷ᵈ [])
+      error1 "Unsolved metavariables remaining in withSafeReset!"
+
+-- apply a list of terms to a name, picking the correct constructor of the term datatype & visibility
+applyWithVisibility : Name → List Term → M Term
+applyWithVisibility n l = do
+  (argTys , _) ← getType' n
+  nameConstr n (zipWith (λ where (abs _ (arg i _)) → arg i) argTys l)
+
+applyWithVisibilityDB : ℕ → List Term → M Term
+applyWithVisibilityDB n l = do
+  (argTys , _) ← getTypeDB n
+  return $ var n (zipWith (λ where (abs _ (arg i _)) → arg i) argTys l)
 

\ No newline at end of file
diff --git a/Reflection.Utils.TCM.html b/Reflection.Utils.TCM.html
index f1ce233..8c14b6f 100644
--- a/Reflection.Utils.TCM.html
+++ b/Reflection.Utils.TCM.html
@@ -1,5 +1,5 @@
 
-Reflection.Utils.TCMSource code on Github
{-# OPTIONS --safe --without-K #-}
+Reflection.Utils.TCMSource code on Github
{-# OPTIONS --safe --without-K #-}
 module Reflection.Utils.TCM where
 
 open import Reflection
@@ -9,5 +9,5 @@
 import Class.MonadReader as C
 import Class.MonadTC as C
 open import Reflection.Utils.TCI {TC} ⦃ C.Monad-TC ⦄ ⦃ C.MonadError-TC ⦄
-  ⦃ record { ask = C.initTCEnv ; local = λ _ x → x } ⦄ ⦃ C.MonadTC-TC ⦄ public
+  ⦃ record { ask = C.initTCEnv ; local = λ _ x → x } ⦄ ⦃ C.MonadTC-TC ⦄ public
 

\ No newline at end of file
diff --git a/Reflection.Utils.html b/Reflection.Utils.html
index 93f1373..11e1c33 100644
--- a/Reflection.Utils.html
+++ b/Reflection.Utils.html
@@ -1,5 +1,5 @@
 
-Reflection.UtilsSource code on Github
{-# OPTIONS --safe --without-K #-}
+Reflection.UtilsSource code on Github
{-# OPTIONS --safe --without-K #-}
 module Reflection.Utils where
 
 open import Meta.Prelude
@@ -252,4 +252,10 @@
     else
       clause [] [ vArg (proj f) ] (f ∙⟦ rexp ⟧)
     ) []
+
+toTelescope : List (Abs (Arg Type)) → Telescope
+toTelescope = map (λ where (abs n x) → (n , x))
+
+fromTelescope : Telescope → List (Abs (Arg Type))
+fromTelescope = map (λ where (n , x) → (abs n x))
 

\ No newline at end of file
diff --git a/Reflection.html b/Reflection.html
index fe2832d..f2bbd10 100644
--- a/Reflection.html
+++ b/Reflection.html
@@ -1,5 +1,5 @@
 
-ReflectionSource code on Github
------------------------------------------------------------------------
+ReflectionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Support for reflection
diff --git a/Relation.Binary.Bundles.html b/Relation.Binary.Bundles.html
index 2046a3f..326fe8e 100644
--- a/Relation.Binary.Bundles.html
+++ b/Relation.Binary.Bundles.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.BundlesSource code on Github
------------------------------------------------------------------------
+Relation.Binary.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bundles for homogeneous binary relations
diff --git a/Relation.Binary.Consequences.html b/Relation.Binary.Consequences.html
index 2fd003f..d8352b5 100644
--- a/Relation.Binary.Consequences.html
+++ b/Relation.Binary.Consequences.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.ConsequencesSource code on Github
------------------------------------------------------------------------
+Relation.Binary.ConsequencesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some properties imply others
diff --git a/Relation.Binary.Construct.Closure.Reflexive.Properties.html b/Relation.Binary.Construct.Closure.Reflexive.Properties.html
index d675a4c..afd73db 100644
--- a/Relation.Binary.Construct.Closure.Reflexive.Properties.html
+++ b/Relation.Binary.Construct.Closure.Reflexive.Properties.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.Closure.Reflexive.PropertiesSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.Closure.Reflexive.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Some properties of reflexive closures
diff --git a/Relation.Binary.Construct.Closure.Reflexive.html b/Relation.Binary.Construct.Closure.Reflexive.html
index c2f777b..7712311 100644
--- a/Relation.Binary.Construct.Closure.Reflexive.html
+++ b/Relation.Binary.Construct.Closure.Reflexive.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.Closure.ReflexiveSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.Closure.ReflexiveSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Reflexive closures
diff --git a/Relation.Binary.Construct.Composition.html b/Relation.Binary.Construct.Composition.html
index 491fa0a..1d53526 100644
--- a/Relation.Binary.Construct.Composition.html
+++ b/Relation.Binary.Construct.Composition.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.CompositionSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.CompositionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Composition of two binary relations
diff --git a/Relation.Binary.Construct.Constant.Core.html b/Relation.Binary.Construct.Constant.Core.html
index e79db25..9b3d270 100644
--- a/Relation.Binary.Construct.Constant.Core.html
+++ b/Relation.Binary.Construct.Constant.Core.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.Constant.CoreSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.Constant.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The binary relation defined by a constant
diff --git a/Relation.Binary.Construct.Flip.EqAndOrd.html b/Relation.Binary.Construct.Flip.EqAndOrd.html
index 986b4ed..223287f 100644
--- a/Relation.Binary.Construct.Flip.EqAndOrd.html
+++ b/Relation.Binary.Construct.Flip.EqAndOrd.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.Flip.EqAndOrdSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.Flip.EqAndOrdSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Many properties which hold for `∼` also hold for `flip ∼`. Unlike
diff --git a/Relation.Binary.Construct.Intersection.html b/Relation.Binary.Construct.Intersection.html
index 603136f..6fc4202 100644
--- a/Relation.Binary.Construct.Intersection.html
+++ b/Relation.Binary.Construct.Intersection.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.IntersectionSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.IntersectionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Intersection of two binary relations
diff --git a/Relation.Binary.Construct.NaturalOrder.Left.html b/Relation.Binary.Construct.NaturalOrder.Left.html
index 055b68c..86740ae 100644
--- a/Relation.Binary.Construct.NaturalOrder.Left.html
+++ b/Relation.Binary.Construct.NaturalOrder.Left.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.NaturalOrder.LeftSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.NaturalOrder.LeftSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Conversion of binary operators to binary relations via the left
diff --git a/Relation.Binary.Construct.NonStrictToStrict.html b/Relation.Binary.Construct.NonStrictToStrict.html
index a1b6756..49907d4 100644
--- a/Relation.Binary.Construct.NonStrictToStrict.html
+++ b/Relation.Binary.Construct.NonStrictToStrict.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.NonStrictToStrictSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.NonStrictToStrictSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Conversion of _≤_ to _<_
diff --git a/Relation.Binary.Construct.On.html b/Relation.Binary.Construct.On.html
index 1c900cb..0739064 100644
--- a/Relation.Binary.Construct.On.html
+++ b/Relation.Binary.Construct.On.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.OnSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.OnSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Many properties which hold for `_∼_` also hold for `_∼_ on f`
diff --git a/Relation.Binary.Construct.Subst.Equality.html b/Relation.Binary.Construct.Subst.Equality.html
index 132c10f..18b8e41 100644
--- a/Relation.Binary.Construct.Subst.Equality.html
+++ b/Relation.Binary.Construct.Subst.Equality.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Construct.Subst.EqualitySource code on Github
------------------------------------------------------------------------
+Relation.Binary.Construct.Subst.EqualitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Substituting equalities for binary relations
diff --git a/Relation.Binary.Core.html b/Relation.Binary.Core.html
index f3bddd9..c8d164c 100644
--- a/Relation.Binary.Core.html
+++ b/Relation.Binary.Core.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.CoreSource code on Github
------------------------------------------------------------------------
+Relation.Binary.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of binary relations
diff --git a/Relation.Binary.Definitions.html b/Relation.Binary.Definitions.html
index ca2d2e9..9bb2297 100644
--- a/Relation.Binary.Definitions.html
+++ b/Relation.Binary.Definitions.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.DefinitionsSource code on Github
------------------------------------------------------------------------
+Relation.Binary.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of binary relations
diff --git a/Relation.Binary.Indexed.Heterogeneous.Bundles.html b/Relation.Binary.Indexed.Heterogeneous.Bundles.html
index 6b78987..4cc7799 100644
--- a/Relation.Binary.Indexed.Heterogeneous.Bundles.html
+++ b/Relation.Binary.Indexed.Heterogeneous.Bundles.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Indexed.Heterogeneous.BundlesSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Indexed.Heterogeneous.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Indexed binary relations
diff --git a/Relation.Binary.Indexed.Heterogeneous.Construct.Trivial.html b/Relation.Binary.Indexed.Heterogeneous.Construct.Trivial.html
index 5873519..199bacf 100644
--- a/Relation.Binary.Indexed.Heterogeneous.Construct.Trivial.html
+++ b/Relation.Binary.Indexed.Heterogeneous.Construct.Trivial.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Indexed.Heterogeneous.Construct.TrivialSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Indexed.Heterogeneous.Construct.TrivialSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Creates trivially indexed records from their non-indexed counterpart.
diff --git a/Relation.Binary.Indexed.Heterogeneous.Core.html b/Relation.Binary.Indexed.Heterogeneous.Core.html
index 1ab677f..ea73e05 100644
--- a/Relation.Binary.Indexed.Heterogeneous.Core.html
+++ b/Relation.Binary.Indexed.Heterogeneous.Core.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Indexed.Heterogeneous.CoreSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Indexed.Heterogeneous.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Indexed binary relations
diff --git a/Relation.Binary.Indexed.Heterogeneous.Definitions.html b/Relation.Binary.Indexed.Heterogeneous.Definitions.html
index 88d8981..3ac56d9 100644
--- a/Relation.Binary.Indexed.Heterogeneous.Definitions.html
+++ b/Relation.Binary.Indexed.Heterogeneous.Definitions.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Indexed.Heterogeneous.DefinitionsSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Indexed.Heterogeneous.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Indexed binary relations
diff --git a/Relation.Binary.Indexed.Heterogeneous.Structures.html b/Relation.Binary.Indexed.Heterogeneous.Structures.html
index 57166b4..d3c1e7f 100644
--- a/Relation.Binary.Indexed.Heterogeneous.Structures.html
+++ b/Relation.Binary.Indexed.Heterogeneous.Structures.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Indexed.Heterogeneous.StructuresSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Indexed.Heterogeneous.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Indexed binary relations
diff --git a/Relation.Binary.Indexed.Heterogeneous.html b/Relation.Binary.Indexed.Heterogeneous.html
index 03d89da..0ef5a71 100644
--- a/Relation.Binary.Indexed.Heterogeneous.html
+++ b/Relation.Binary.Indexed.Heterogeneous.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Indexed.HeterogeneousSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Indexed.HeterogeneousSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Heterogeneously-indexed binary relations
diff --git a/Relation.Binary.Lattice.Bundles.html b/Relation.Binary.Lattice.Bundles.html
index 0405adb..ccb0323 100644
--- a/Relation.Binary.Lattice.Bundles.html
+++ b/Relation.Binary.Lattice.Bundles.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Lattice.BundlesSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Lattice.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bundles for order-theoretic lattices
diff --git a/Relation.Binary.Lattice.Definitions.html b/Relation.Binary.Lattice.Definitions.html
index 04d5668..d08beb4 100644
--- a/Relation.Binary.Lattice.Definitions.html
+++ b/Relation.Binary.Lattice.Definitions.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Lattice.DefinitionsSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Lattice.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Definitions for order-theoretic lattices
diff --git a/Relation.Binary.Lattice.Structures.html b/Relation.Binary.Lattice.Structures.html
index 1452cfe..66ccc37 100644
--- a/Relation.Binary.Lattice.Structures.html
+++ b/Relation.Binary.Lattice.Structures.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Lattice.StructuresSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Lattice.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Structures for order-theoretic lattices
diff --git a/Relation.Binary.Lattice.html b/Relation.Binary.Lattice.html
index 295e50e..55c4fb7 100644
--- a/Relation.Binary.Lattice.html
+++ b/Relation.Binary.Lattice.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.LatticeSource code on Github
------------------------------------------------------------------------
+Relation.Binary.LatticeSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Order-theoretic lattices
diff --git a/Relation.Binary.Morphism.Bundles.html b/Relation.Binary.Morphism.Bundles.html
index 70460fd..6328832 100644
--- a/Relation.Binary.Morphism.Bundles.html
+++ b/Relation.Binary.Morphism.Bundles.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Morphism.BundlesSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Morphism.BundlesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Bundles for morphisms between binary relations
diff --git a/Relation.Binary.Morphism.Definitions.html b/Relation.Binary.Morphism.Definitions.html
index 0a83c21..779f634 100644
--- a/Relation.Binary.Morphism.Definitions.html
+++ b/Relation.Binary.Morphism.Definitions.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Morphism.DefinitionsSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Morphism.DefinitionsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Basic definitions for morphisms between algebraic structures
diff --git a/Relation.Binary.Morphism.OrderMonomorphism.html b/Relation.Binary.Morphism.OrderMonomorphism.html
index d61f603..b786624 100644
--- a/Relation.Binary.Morphism.OrderMonomorphism.html
+++ b/Relation.Binary.Morphism.OrderMonomorphism.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Morphism.OrderMonomorphismSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Morphism.OrderMonomorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Consequences of a monomorphism between orders
diff --git a/Relation.Binary.Morphism.RelMonomorphism.html b/Relation.Binary.Morphism.RelMonomorphism.html
index bfa0229..9e4173a 100644
--- a/Relation.Binary.Morphism.RelMonomorphism.html
+++ b/Relation.Binary.Morphism.RelMonomorphism.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Morphism.RelMonomorphismSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Morphism.RelMonomorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Consequences of a monomorphism between binary relations
diff --git a/Relation.Binary.Morphism.Structures.html b/Relation.Binary.Morphism.Structures.html
index 4fd3940..168cb33 100644
--- a/Relation.Binary.Morphism.Structures.html
+++ b/Relation.Binary.Morphism.Structures.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Morphism.StructuresSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Morphism.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Order morphisms
diff --git a/Relation.Binary.Morphism.html b/Relation.Binary.Morphism.html
index 51a2cf8..43aa196 100644
--- a/Relation.Binary.Morphism.html
+++ b/Relation.Binary.Morphism.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.MorphismSource code on Github
------------------------------------------------------------------------
+Relation.Binary.MorphismSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Order morphisms
diff --git a/Relation.Binary.Properties.ApartnessRelation.html b/Relation.Binary.Properties.ApartnessRelation.html
index 4036578..31c8c7c 100644
--- a/Relation.Binary.Properties.ApartnessRelation.html
+++ b/Relation.Binary.Properties.ApartnessRelation.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Properties.ApartnessRelationSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Properties.ApartnessRelationSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Apartness properties
diff --git a/Relation.Binary.Properties.DecSetoid.html b/Relation.Binary.Properties.DecSetoid.html
index 03e4e46..c5f7576 100644
--- a/Relation.Binary.Properties.DecSetoid.html
+++ b/Relation.Binary.Properties.DecSetoid.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Properties.DecSetoidSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Properties.DecSetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Every decidable setoid induces tight apartness relation.
diff --git a/Relation.Binary.Properties.DecTotalOrder.html b/Relation.Binary.Properties.DecTotalOrder.html
index 132ccfa..12da87f 100644
--- a/Relation.Binary.Properties.DecTotalOrder.html
+++ b/Relation.Binary.Properties.DecTotalOrder.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Properties.DecTotalOrderSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Properties.DecTotalOrderSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties satisfied by decidable total orders
diff --git a/Relation.Binary.Properties.Poset.html b/Relation.Binary.Properties.Poset.html
index 095bbf4..ef65d99 100644
--- a/Relation.Binary.Properties.Poset.html
+++ b/Relation.Binary.Properties.Poset.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Properties.PosetSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Properties.PosetSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties satisfied by posets
diff --git a/Relation.Binary.Properties.Preorder.html b/Relation.Binary.Properties.Preorder.html
index 20ad3a7..f840c8c 100644
--- a/Relation.Binary.Properties.Preorder.html
+++ b/Relation.Binary.Properties.Preorder.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Properties.PreorderSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Properties.PreorderSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties satisfied by preorders
diff --git a/Relation.Binary.Properties.Setoid.html b/Relation.Binary.Properties.Setoid.html
index 361d67c..a59931e 100644
--- a/Relation.Binary.Properties.Setoid.html
+++ b/Relation.Binary.Properties.Setoid.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Properties.SetoidSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Properties.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Additional properties for setoids
diff --git a/Relation.Binary.Properties.TotalOrder.html b/Relation.Binary.Properties.TotalOrder.html
index 55e7c74..22d4e6b 100644
--- a/Relation.Binary.Properties.TotalOrder.html
+++ b/Relation.Binary.Properties.TotalOrder.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Properties.TotalOrderSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Properties.TotalOrderSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties satisfied by total orders
diff --git a/Relation.Binary.PropositionalEquality.Algebra.html b/Relation.Binary.PropositionalEquality.Algebra.html
index f529210..85e96bb 100644
--- a/Relation.Binary.PropositionalEquality.Algebra.html
+++ b/Relation.Binary.PropositionalEquality.Algebra.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.PropositionalEquality.AlgebraSource code on Github
------------------------------------------------------------------------
+Relation.Binary.PropositionalEquality.AlgebraSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Propositional (intensional) equality - Algebraic structures
diff --git a/Relation.Binary.PropositionalEquality.Core.html b/Relation.Binary.PropositionalEquality.Core.html
index 5d13990..5fc73b1 100644
--- a/Relation.Binary.PropositionalEquality.Core.html
+++ b/Relation.Binary.PropositionalEquality.Core.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.PropositionalEquality.CoreSource code on Github
------------------------------------------------------------------------
+Relation.Binary.PropositionalEquality.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Propositional equality
diff --git a/Relation.Binary.PropositionalEquality.Properties.html b/Relation.Binary.PropositionalEquality.Properties.html
index 8837d56..96e133d 100644
--- a/Relation.Binary.PropositionalEquality.Properties.html
+++ b/Relation.Binary.PropositionalEquality.Properties.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.PropositionalEquality.PropertiesSource code on Github
------------------------------------------------------------------------
+Relation.Binary.PropositionalEquality.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Propositional equality
diff --git a/Relation.Binary.PropositionalEquality.html b/Relation.Binary.PropositionalEquality.html
index 2e7739c..4d9d219 100644
--- a/Relation.Binary.PropositionalEquality.html
+++ b/Relation.Binary.PropositionalEquality.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.PropositionalEqualitySource code on Github
------------------------------------------------------------------------
+Relation.Binary.PropositionalEqualitySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Propositional (intensional) equality
diff --git a/Relation.Binary.Reasoning.Base.Double.html b/Relation.Binary.Reasoning.Base.Double.html
index 8755e5b..0f573ca 100644
--- a/Relation.Binary.Reasoning.Base.Double.html
+++ b/Relation.Binary.Reasoning.Base.Double.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Reasoning.Base.DoubleSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Reasoning.Base.DoubleSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The basic code for equational reasoning with two relations:
diff --git a/Relation.Binary.Reasoning.Base.Single.html b/Relation.Binary.Reasoning.Base.Single.html
index 8f886c4..792f352 100644
--- a/Relation.Binary.Reasoning.Base.Single.html
+++ b/Relation.Binary.Reasoning.Base.Single.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Reasoning.Base.SingleSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Reasoning.Base.SingleSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The basic code for equational reasoning with a single relation
diff --git a/Relation.Binary.Reasoning.Base.Triple.html b/Relation.Binary.Reasoning.Base.Triple.html
index be679f5..6c2eed2 100644
--- a/Relation.Binary.Reasoning.Base.Triple.html
+++ b/Relation.Binary.Reasoning.Base.Triple.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Reasoning.Base.TripleSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Reasoning.Base.TripleSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- The basic code for equational reasoning with three relations:
diff --git a/Relation.Binary.Reasoning.Preorder.html b/Relation.Binary.Reasoning.Preorder.html
index 3bdd16f..89a074c 100644
--- a/Relation.Binary.Reasoning.Preorder.html
+++ b/Relation.Binary.Reasoning.Preorder.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Reasoning.PreorderSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Reasoning.PreorderSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Convenient syntax for "equational reasoning" using a preorder
diff --git a/Relation.Binary.Reasoning.Setoid.html b/Relation.Binary.Reasoning.Setoid.html
index 40d6ba4..f0ccdd6 100644
--- a/Relation.Binary.Reasoning.Setoid.html
+++ b/Relation.Binary.Reasoning.Setoid.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Reasoning.SetoidSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Reasoning.SetoidSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Convenient syntax for reasoning with a setoid
diff --git a/Relation.Binary.Reasoning.Syntax.html b/Relation.Binary.Reasoning.Syntax.html
index a5ef839..629ea12 100644
--- a/Relation.Binary.Reasoning.Syntax.html
+++ b/Relation.Binary.Reasoning.Syntax.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Reasoning.SyntaxSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Reasoning.SyntaxSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Syntax for the building blocks of equational reasoning modules
diff --git a/Relation.Binary.Reflection.html b/Relation.Binary.Reflection.html
index 9200d96..54756d7 100644
--- a/Relation.Binary.Reflection.html
+++ b/Relation.Binary.Reflection.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.ReflectionSource code on Github
------------------------------------------------------------------------
+Relation.Binary.ReflectionSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Helpers intended to ease the development of "tactics" which use
diff --git a/Relation.Binary.Structures.Biased.html b/Relation.Binary.Structures.Biased.html
index 0023017..d80646d 100644
--- a/Relation.Binary.Structures.Biased.html
+++ b/Relation.Binary.Structures.Biased.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.Structures.BiasedSource code on Github
------------------------------------------------------------------------
+Relation.Binary.Structures.BiasedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Ways to give instances of certain structures where some fields can
diff --git a/Relation.Binary.Structures.html b/Relation.Binary.Structures.html
index 75d9984..6e32d3f 100644
--- a/Relation.Binary.Structures.html
+++ b/Relation.Binary.Structures.html
@@ -1,5 +1,5 @@
 
-Relation.Binary.StructuresSource code on Github
------------------------------------------------------------------------
+Relation.Binary.StructuresSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Structures for homogeneous binary relations
diff --git a/Relation.Binary.html b/Relation.Binary.html
index 53d608c..18463e1 100644
--- a/Relation.Binary.html
+++ b/Relation.Binary.html
@@ -1,5 +1,5 @@
 
-Relation.BinarySource code on Github
------------------------------------------------------------------------
+Relation.BinarySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of homogeneous binary relations
diff --git a/Relation.Nullary.Decidable.Core.html b/Relation.Nullary.Decidable.Core.html
index 7183080..abe89aa 100644
--- a/Relation.Nullary.Decidable.Core.html
+++ b/Relation.Nullary.Decidable.Core.html
@@ -1,5 +1,5 @@
 
-Relation.Nullary.Decidable.CoreSource code on Github
------------------------------------------------------------------------
+Relation.Nullary.Decidable.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Operations on and properties of decidable relations
diff --git a/Relation.Nullary.Decidable.html b/Relation.Nullary.Decidable.html
index db8e452..1b5fc3a 100644
--- a/Relation.Nullary.Decidable.html
+++ b/Relation.Nullary.Decidable.html
@@ -1,5 +1,5 @@
 
-Relation.Nullary.DecidableSource code on Github
------------------------------------------------------------------------
+Relation.Nullary.DecidableSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Operations on and properties of decidable relations
diff --git a/Relation.Nullary.Indexed.html b/Relation.Nullary.Indexed.html
index e3e0a3f..8a88363 100644
--- a/Relation.Nullary.Indexed.html
+++ b/Relation.Nullary.Indexed.html
@@ -1,5 +1,5 @@
 
-Relation.Nullary.IndexedSource code on Github
------------------------------------------------------------------------
+Relation.Nullary.IndexedSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Negation indexed by a Level
diff --git a/Relation.Nullary.Negation.Core.html b/Relation.Nullary.Negation.Core.html
index aa71305..7a90367 100644
--- a/Relation.Nullary.Negation.Core.html
+++ b/Relation.Nullary.Negation.Core.html
@@ -1,5 +1,5 @@
 
-Relation.Nullary.Negation.CoreSource code on Github
------------------------------------------------------------------------
+Relation.Nullary.Negation.CoreSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Core properties related to negation
diff --git a/Relation.Nullary.Negation.html b/Relation.Nullary.Negation.html
index 46367ff..1113062 100644
--- a/Relation.Nullary.Negation.html
+++ b/Relation.Nullary.Negation.html
@@ -1,5 +1,5 @@
 
-Relation.Nullary.NegationSource code on Github
------------------------------------------------------------------------
+Relation.Nullary.NegationSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties related to negation
diff --git a/Relation.Nullary.Recomputable.html b/Relation.Nullary.Recomputable.html
index 93d697e..56de1c9 100644
--- a/Relation.Nullary.Recomputable.html
+++ b/Relation.Nullary.Recomputable.html
@@ -1,5 +1,5 @@
 
-Relation.Nullary.RecomputableSource code on Github
------------------------------------------------------------------------
+Relation.Nullary.RecomputableSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Recomputable types and their algebra as Harrop formulas
diff --git a/Relation.Nullary.Reflects.html b/Relation.Nullary.Reflects.html
index 00703b3..ae42e7f 100644
--- a/Relation.Nullary.Reflects.html
+++ b/Relation.Nullary.Reflects.html
@@ -1,5 +1,5 @@
 
-Relation.Nullary.ReflectsSource code on Github
------------------------------------------------------------------------
+Relation.Nullary.ReflectsSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of the `Reflects` construct
diff --git a/Relation.Nullary.html b/Relation.Nullary.html
index d4b32eb..a851b8c 100644
--- a/Relation.Nullary.html
+++ b/Relation.Nullary.html
@@ -1,5 +1,5 @@
 
-Relation.NullarySource code on Github
------------------------------------------------------------------------
+Relation.NullarySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Operations on nullary relations (like negation and decidability)
diff --git a/Relation.Unary.PredicateTransformer.html b/Relation.Unary.PredicateTransformer.html
index ff97140..30bc6c1 100644
--- a/Relation.Unary.PredicateTransformer.html
+++ b/Relation.Unary.PredicateTransformer.html
@@ -1,5 +1,5 @@
 
-Relation.Unary.PredicateTransformerSource code on Github
------------------------------------------------------------------------
+Relation.Unary.PredicateTransformerSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Predicate transformers
diff --git a/Relation.Unary.Properties.html b/Relation.Unary.Properties.html
index 7cf583b..c27c9b2 100644
--- a/Relation.Unary.Properties.html
+++ b/Relation.Unary.Properties.html
@@ -1,5 +1,5 @@
 
-Relation.Unary.PropertiesSource code on Github
------------------------------------------------------------------------
+Relation.Unary.PropertiesSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Properties of constructions over unary relations
diff --git a/Relation.Unary.html b/Relation.Unary.html
index 938082d..d4a296d 100644
--- a/Relation.Unary.html
+++ b/Relation.Unary.html
@@ -1,5 +1,5 @@
 
-Relation.UnarySource code on Github
------------------------------------------------------------------------
+Relation.UnarySource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Unary relations
diff --git a/Tactic.AnyOf.html b/Tactic.AnyOf.html
index 04fb661..548995d 100644
--- a/Tactic.AnyOf.html
+++ b/Tactic.AnyOf.html
@@ -1,5 +1,5 @@
 
-Tactic.AnyOfSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.AnyOfSource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- anyOf: take the first term that type checks
 --------------------------------------------------------------------------------
@@ -18,15 +18,15 @@
 
 anyOf' : List Term → ITactic
 anyOf' = inDebugPath "anyOf" ∘
-  foldl (λ x t → catch (debugLog ("Attempting: " ∷ᵈ t ∷ᵈ []) >> unifyWithGoal t >> debugLog ("Success with: " ∷ᵈ t ∷ᵈ [])) (λ _ → x))
-    (logAndError1 "None of the provded terms solve the goal!")
+  foldl (λ x t → catch (debugLog ("Attempting: " ∷ᵈ t ∷ᵈ []) >> unifyWithGoal t >> debugLog ("Success with: " ∷ᵈ t ∷ᵈ [])) (λ _ → x))
+    (logAndError1 "None of the provded terms solve the goal!")
 
 anyOfⁿ : List Name → ITactic
 anyOfⁿ = inDebugPath "anyOf" ∘
-  foldl (λ x n → catch (debugLog ("Attempting: " ∷ᵈ n ∷ᵈ []) >> unifyWithGoal (n ∙) >> debugLog ("Success with: " ∷ᵈ n ∷ᵈ [])) (λ _ → x))
-    (logAndError1 "None of the provded terms solve the goal!")
+  foldl (λ x n → catch (debugLog ("Attempting: " ∷ᵈ n ∷ᵈ []) >> unifyWithGoal (n ∙) >> debugLog ("Success with: " ∷ᵈ n ∷ᵈ [])) (λ _ → x))
+    (logAndError1 "None of the provded terms solve the goal!")
 
-module _ ⦃ _ : TCOptions ⦄ where
+module _ ⦃ _ : TCOptions ⦄ where
   anyOfᵗ : List Term → Tactic
   anyOfᵗ l = initTac $ anyOf' l
 
diff --git a/Tactic.Assumption.html b/Tactic.Assumption.html
index 9187248..f7dfb0f 100644
--- a/Tactic.Assumption.html
+++ b/Tactic.Assumption.html
@@ -1,54 +1,47 @@
 
-Tactic.AssumptionSource code on Github
{-# OPTIONS --safe --without-K #-}
---------------------------------------------------------------------------------
--- assumption: try to solve the goal with one of the available assumptions
---------------------------------------------------------------------------------
-
-module Tactic.Assumption where
-
-open import Meta.Prelude
-open import Meta.Init
-
-open import Class.Functor
-open import Class.Monad
-open import Class.MonadError.Instances
-open import Class.MonadReader.Instances
-open import Class.MonadTC.Instances
-
-open import Reflection.Tactic
-open import Reflection.Utils
-open import Reflection.Utils.TCI
-
-instance
-  _ = Functor-M
-
-solve : ⦃ TCOptions ⦄ → Term → Tactic
-solve t = initTac $ runSpeculative $ do
-  inj₁ goal ← reader TCEnv.goal
-    where _ → error1 "solve: Goal is not a term!"
-  metas ← findMetas <$> checkType t goal
-  if null metas
-    then (_, true)  <$> unify goal t
-    else (_, false) <$> error1 "Unsolved metavariables remaining!"
-
-assumption' : ITactic
-assumption' = inDebugPath "assumption" do
-  c ← getContext
-  foldl (λ x k → do
-    catch (unifyWithGoal (♯ k) >> debugLog ("Success with: " ∷ᵈ ♯ k ∷ᵈ [])) (λ _ → x))
-    (logAndError1 "No valid assumption!") (downFrom $ length c)
-
-module _ ⦃ _ : TCOptions ⦄ where
-  macro
-    assumption = initTac assumption'
-    assumptionOpts = initTacOpts assumption'
-
-private
-  open import Tactic.Defaults
-  module Test where
-    test₁ : {A B : Set} → A → B → A
-    test₁ a b = assumption
-
-    test₂ : {A B : Set} → A → B → B
-    test₂ a b = assumption
+Tactic.AssumptionSource code on Github
{-# OPTIONS --safe --without-K #-}
+
+{-# OPTIONS -v allTactics:100 #-}
+--------------------------------------------------------------------------------
+-- assumption: try to solve the goal with one of the available assumptions
+--------------------------------------------------------------------------------
+
+module Tactic.Assumption where
+
+open import Meta.Prelude
+open import Meta.Init
+
+open import Class.Functor
+open import Class.Monad
+open import Class.MonadError.Instances
+open import Class.MonadReader.Instances
+open import Class.MonadTC.Instances
+
+open import Reflection.Tactic
+open import Reflection.Utils
+open import Reflection.Utils.TCI
+
+instance
+  _ = Functor-M
+
+assumption' : ITactic
+assumption' = inDebugPath "assumption" do
+  c ← getContext
+  foldl (λ x k → do
+    catch (unifyWithGoal (♯ k) >> debugLog ("Success with: " ∷ᵈ ♯ k ∷ᵈ [])) (λ _ → x))
+    (logAndError1 "No valid assumption!") (downFrom $ length c)
+
+module _ ⦃ _ : TCOptions ⦄ where
+  macro
+    assumption = initTac assumption'
+    assumptionOpts = initTacOpts assumption'
+
+private
+  open import Tactic.Defaults
+  module Test where
+    test₁ : {A B : Set} → A → B → A
+    test₁ a b = assumption
+
+    test₂ : {A B : Set} → A → B → B
+    test₂ a b = assumption
 

\ No newline at end of file
diff --git a/Tactic.ByEq.html b/Tactic.ByEq.html
index c669271..a2ab531 100644
--- a/Tactic.ByEq.html
+++ b/Tactic.ByEq.html
@@ -1,5 +1,5 @@
 
-Tactic.ByEqSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.ByEqSource code on Github
{-# OPTIONS --safe --without-K #-}
 module Tactic.ByEq where
 
 open import Meta.Init hiding (TC)
diff --git a/Tactic.Case.html b/Tactic.Case.html
index 9fb5b08..8401b93 100644
--- a/Tactic.Case.html
+++ b/Tactic.Case.html
@@ -1,5 +1,5 @@
 
-Tactic.CaseSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.CaseSource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- case: pattern-match on the first term, continue with the second tactic
 --------------------------------------------------------------------------------
@@ -18,29 +18,29 @@
 open import Class.Functor
 open import Class.MonadTC
 
-open MonadTC ⦃...⦄
+open MonadTC ⦃...⦄
 
 instance
   _ = MonadTC-TCI
-  _ = ContextMonad-MonadTC
+  _ = ContextMonad-MonadTC
   _ = Functor-M
 
-open ClauseExprM
+open ClauseExprM
 
-matchInductive : Type → (SinglePattern → TC (ClauseExpr ⊎ Maybe Term)) → TC ClauseExpr
+matchInductive : Type → (SinglePattern → TC (ClauseExpr ⊎ Maybe Term)) → TC ClauseExpr
 matchInductive ty rhs = do
-  ps ← constructorPatterns' ty
-  matchExprM (map (λ p → p , rhs p) ps)
+  ps ← constructorPatterns' ty
+  matchExprM (map (λ p → p , rhs p) ps)
 
-genMatchingClauses : Type → TC Term → TC ClauseExpr
+genMatchingClauses : Type → TC Term → TC ClauseExpr
 genMatchingClauses ty x = matchInductive ty (λ _ → (inj₂ ∘ just) <$> x)
 
 -- apply tac to all holes
 case : ∀ {a} {A : Set a} → A → ITactic → ITactic
 case a tac = inDebugPath "case" do
-  t ← quoteTC a
-  ty ← inferType t
-  unifyWithGoal =<< caseMatch t (genMatchingClauses ty (withGoalHole tac))
+  t ← quoteTC a
+  ty ← inferType t
+  unifyWithGoal =<< caseMatch t (genMatchingClauses ty (withGoalHole tac))
 
 private
   module Test (A B : Set) where
@@ -53,17 +53,17 @@
         b : B
 
     test₁ : A × B → A
-    test₁ x = by (case x assumption')
+    test₁ x = by (case x assumption')
 
     test₂ : A × B → B
-    test₂ x = by (case x assumption')
+    test₂ x = by (case x assumption')
 
     test₃ : A ⊎ A → A
-    test₃ x = by (case x assumption')
+    test₃ x = by (case x assumption')
 
     test₄ : TestType → A
-    test₄ x = by (case x assumption')
+    test₄ x = by (case x assumption')
 
     test₅ : TestType → B
-    test₅ x = by (case x assumption')
+    test₅ x = by (case x assumption')
 

\ No newline at end of file
diff --git a/Tactic.ClauseBuilder.html b/Tactic.ClauseBuilder.html
index 290cac8..b93cbf6 100644
--- a/Tactic.ClauseBuilder.html
+++ b/Tactic.ClauseBuilder.html
@@ -1,5 +1,5 @@
 
-Tactic.ClauseBuilderSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.ClauseBuilderSource code on Github
{-# OPTIONS --safe --without-K #-}
 module Tactic.ClauseBuilder where
 
 open import Meta.Prelude hiding ([_,_])
@@ -19,326 +19,340 @@
 open import Reflection.Utils
 open import Reflection.Utils.TCI
 
-open import Class.DecEq
-open import Class.Functor
-open import Class.MonadError.Instances
-open import Class.MonadReader.Instances
-open import Class.MonadTC.Instances
-open import Class.Traversable
-
-module _ where
-  open import Class.Monad hiding (Monad-List) public
-
-import Class.Monad
-
-private variable
-  a b : Level
-  A : Set a
-
-record ClauseBuilder (M : Set → Set) : Set₁ where
-  field
-    Base : Set → Set
-    liftBase : Base A → M A
-    addPattern : List (String × Arg Type) → Arg Pattern → M A → M A
-    toClause : M (Maybe Term) → Base Clause
-
-open ClauseBuilder {{...}} public
-
-SinglePattern : Set
-SinglePattern = List (String × Arg Type) × Arg Pattern
-
-typedVarSinglePattern : String → Arg Type → SinglePattern
-typedVarSinglePattern n t@(arg i _) = ([ n , t ] , arg i (` 0))
-
-varSinglePattern : Arg String → SinglePattern
-varSinglePattern (arg i n) = ([ n , arg i unknown ] , arg i (` 0))
-
-multiSinglePattern : List String → Arg Pattern → SinglePattern
-multiSinglePattern s p = ((_, vArg unknown) <$> s) , p
-
-findIndexDefault : List ℕ → ℕ → ℕ → ℕ
-findIndexDefault l d a with filter (λ where (i , x) → x ≟ a) (zipWithIndex _,_ l)
-... | []          = d
-... | (i , _) ∷ _ = i
-
-singlePatternFromPattern : Arg Pattern → SinglePattern
-singlePatternFromPattern (arg i p) =
-  replicate (length (appearingIndices p)) ("" , vArg unknown) , arg i (replacePatternIndex p)
-  where
-    appearingIndices : Pattern → List ℕ
-    appearingIndicesHelper : List (Arg Pattern) → List ℕ
-
-    appearingIndices (Pattern.con c ps) = appearingIndicesHelper ps
-    appearingIndices (Pattern.dot t) = [] -- TODO: this is probably wrong
-    appearingIndices (` x) = [ x ]
-    appearingIndices (Pattern.lit l) = []
-    appearingIndices (Pattern.proj f) = []
-    appearingIndices (Pattern.absurd x) = []
-
-    appearingIndicesHelper [] = []
-    appearingIndicesHelper (arg _ p ∷ ps) = appearingIndices p ++ appearingIndicesHelper ps
-
-    normalisedIndexList : List ℕ
-    normalisedIndexList = sort $ deduplicate _≟_ $ appearingIndices p
-
-    replacePatternIndex : Pattern → Pattern
-    replacePatternIndexHelper : List (Arg Pattern) → List (Arg Pattern)
-
-    replacePatternIndex (Pattern.con c ps) = Pattern.con c (replacePatternIndexHelper ps)
-    replacePatternIndex (Pattern.dot t) = Pattern.dot t
-    replacePatternIndex (` x) = ` findIndexDefault normalisedIndexList 0 x
-    replacePatternIndex (Pattern.lit l) = Pattern.lit l
-    replacePatternIndex (Pattern.proj f) = Pattern.proj f
-    replacePatternIndex (Pattern.absurd x) = Pattern.absurd x
-
-    replacePatternIndexHelper [] = []
-    replacePatternIndexHelper (arg i p ∷ ps) = (arg i (replacePatternIndex p)) ∷ (replacePatternIndexHelper ps)
-
-module _ {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄ where
-
-  instance _ = Functor-M {M = M}
-
-  ctxSinglePatterns : M (List SinglePattern)
-  ctxSinglePatterns = do
-    ctx ← getContext
-    return (singlePatternFromPattern <$> zipWithIndex (λ where k (_ , (arg i _)) → arg i (` k)) ctx)
-
-  -- TODO: add the ability to match initial hidden arguments
-  -- TODO: add dot patterns
-  constrToPattern : Name → Type → M SinglePattern
-  constrToPattern n ty = do
-    (introTel , _) ← viewTy <$> (runAndReset $ local (λ env → record env { normalisation = true }) $ inferType (n ◆))
-    let patternTel = zipWith (λ where (abs _ (arg i _)) k → arg i (` k)) introTel $ downFrom $ length introTel
-    return (((λ where (abs s (arg i t)) → (s , arg i unknown)) <$> introTel) , (vArg $ Pattern.con n patternTel))
-
-  -- like constrToPattern, but applied to parameters
-  constrToPatternTyped : Name → List Term → M SinglePattern
-  constrToPatternTyped n ps = do
-    t ← applyWithVisibility n ps
-    debugLogᵐ (t ᵛⁿ ∷ᵈᵐ []ᵐ)
-    (introTel , _) ← viewTy <$> (local (λ env → record env { normalisation = true }) $ inferType t)
-    let patternTel = zipWith (λ where (abs _ (arg i _)) k → arg i (` k)) introTel $ downFrom $ length introTel
-    return (((λ where (abs s (arg i t)) → (s , arg i t)) <$> introTel) , (vArg $ Pattern.con n patternTel))
-
-  -- all possible patterns for an inductive type
-  constructorPatterns : Arg Type → M (List SinglePattern)
-  constructorPatterns (arg i ty) = do
-    constrs ← getConstrsForType ty
-    return $ constrs <&> λ where
-      (n , t) → let argInfo = proj₁ $ viewTy t
-        in (((λ where (abs n' t') → n' , t') <$> argInfo)
-           , arg i (Pattern.con n (zipWithIndex (λ where k (abs _ (arg i _)) → arg i (` (length argInfo ∸ ℕ.suc k))) argInfo)))
-
-  -- all possible patterns for an inductive type
-  constructorPatterns' : Type → M (List SinglePattern)
-  constructorPatterns' ty = do
-    constrs ← getConstrsForType ty
-    traverse (λ (n , _) → constrToPattern n ty) constrs
-
-  -- all possible patterns for an inductive type
-  constructorPatternsTyped : Type → List Type → M (List SinglePattern)
-  constructorPatternsTyped ty ps = do
-    constrs ← getConstrsForType ty
-    traverse (λ (n , _) → constrToPatternTyped n ps) constrs
-
-ClauseInfo : Set
-ClauseInfo = List SinglePattern
-
-data ClauseExpr : Set where
-  MatchExpr : List (SinglePattern × (ClauseExpr ⊎ Maybe Term)) → ClauseExpr
-
-multiClauseExpr : List (NE.List⁺ SinglePattern × (ClauseExpr ⊎ Maybe Term)) → ClauseExpr
-multiClauseExpr = MatchExpr ∘ Data.List.map helper
-  where
-    helper' : (List SinglePattern × (ClauseExpr ⊎ Maybe Term)) → ClauseExpr ⊎ Maybe Term
-    helper' ([]     , e) = e
-    helper' (p ∷ ps , e) = inj₁ (MatchExpr [ p , helper' (ps , e) ])
-
-    helper : (NE.List⁺ SinglePattern × (ClauseExpr ⊎ Maybe Term)) → SinglePattern × (ClauseExpr ⊎ Maybe Term)
-    helper (p NE.∷ ps , e) = p , helper' (ps , e)
-
-clauseExprToClauseInfo : ClauseExpr → List (ClauseInfo × Maybe Term)
-clauseExprToClauseInfo (MatchExpr []) = []
-clauseExprToClauseInfo (MatchExpr ((p , inj₁ e) ∷ xs)) =
-  (map₁ (p ∷_) <$> clauseExprToClauseInfo e) ++ clauseExprToClauseInfo (MatchExpr xs)
-clauseExprToClauseInfo (MatchExpr ((p , inj₂ t) ∷ xs)) = ([ p ] , t) ∷ clauseExprToClauseInfo (MatchExpr xs)
-
-clauseInfoToClauseArgs : ClauseInfo → List (String × Arg Type) × List (Arg Pattern)
-clauseInfoToClauseArgs i =
-  case helper 0 i of λ where (tel , ps , _) → (tel , ps)
-  where
-    helper : ℕ → ClauseInfo → List (String × Arg Type) × List (Arg Pattern) × ℕ
-    helper k [] = ([] , [] , k)
-    helper k ((tel' , arg h p) ∷ i) with helper k i
-    ... | (tel , ps , k') = (tel' ++ tel , arg h (mapVariables (_+ k') p) ∷ ps , length tel' + k')
-
-clauseInfoToClause : ClauseInfo → Maybe Term → Clause
-clauseInfoToClause i t with clauseInfoToClauseArgs i | t
-... | tel , ps | just x  = Clause.clause tel ps x
-... | tel , ps | nothing = Clause.absurd-clause tel ps
-
-clauseExprToClauses : ClauseExpr → List Clause
-clauseExprToClauses e = (λ { (i , t) → clauseInfoToClause i t }) <$> clauseExprToClauseInfo e
-
-nonBindingClause : Term → Clause
-nonBindingClause = Clause.clause [] []
-
-clauseExprToPatLam : ClauseExpr → Term
-clauseExprToPatLam e = pat-lam (clauseExprToClauses e) []
-
-record ContextMonad (M : ∀ {a} → Set a → Set a) ⦃ _ : Monad M ⦄ : Setω where
-  field
-    introPatternM : SinglePattern → M A → M A
-
-  extendContextM : Arg Type → M A → M A
-  extendContextM l x = introPatternM (typedVarSinglePattern "" l) x
-
-open ContextMonad ⦃...⦄
-
-Monad-Id : Monad id
-Monad-Id .return = id
-Monad-Id ._>>=_  = flip _$_
-
--- No context
-ContextMonad-Id : ContextMonad id ⦃ Monad-Id ⦄
-ContextMonad-Id .introPatternM _ a = a
-
-module _ {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄ where
-
-  instance _ = Functor-M {M = M}
-
-  refineWithSingle : (Term → Term) → M Term → M Term
-  refineWithSingle ref x = do
-    goalTy ← goalTy
-    m ← newMeta unknown
-    res ← checkType (ref m) goalTy
-    x' ← runWithHole m x
-    unify m x'
-    return $ ref x'
-
-  caseMatch : Term → M ClauseExpr → M Term
-  caseMatch t expr = debugLog ("Match" ∷ᵈ t ∷ᵈ []) >> (refineWithSingle (quote case_of_ ∙⟦ t ∣_⟧) $
-    (λ expr' → pat-lam (clauseExprToClauses expr') []) <$> expr)
-
-  currentTyConstrPatterns : M (List SinglePattern)
-  currentTyConstrPatterns = do
-    (ty ∷ _ , _) ← viewTy′ <$> goalTy
-      where _ → error1 "currentTyConstrPatterns: Goal type is not a forall!"
-    constructorPatterns' (unArg ty)
-
-stripMetaLambdas : Term → Term
-stripMetaLambdas = helper 0
-  where
-    helper : ℕ → Term → Term
-    helper k (lam _ (abs _ t)) = helper (k + 1) t
-    helper k (meta x as) = meta x $ map-Args (mapVars (_∸ k)) $ take (length as ∸ k) as
-    helper _ _ = unknown
-
-module _ {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄ where
-
-  isProj : Pattern → Bool
-  isProj (Pattern.proj _) = true
-  isProj _                = false
-
-  -- if the goal is of type (a : A) → B, return the type of the branch of pattern p and new context
-  specializeType : SinglePattern → Type → M (Type × Telescope)
-  specializeType p@(t , arg i p') goalTy = markDontFail "specializeType" $ inDebugPath "specializeType" $ runAndReset do
-    debugLog ("Goal type to specialize: " ∷ᵈ goalTy ∷ᵈ [])
-    cls@((Clause.clause tel _ _) ∷ _) ← return $ clauseExprToClauses $ MatchExpr $
-        (p , inj₂ (just unknown)) ∷
-        (if isProj p' then [] else [ varSinglePattern (arg i "_") , inj₂ (just unknown) ])
-      where _ → error1 "BUG"
-    debugLog ("With pattern: " ∷ᵈ cls ∷ᵈ [])
-    (pat-lam (cl@(Clause.clause tel' _ (meta x ap)) ∷ _) []) ← checkType (pat-lam cls []) goalTy
-      where t → debugLog ("BUG in specializeType:" ∷ᵈ t ∷ᵈ "\nWith pattern:" ∷ᵈ cls
-                  ∷ᵈ "\nWith type:" ∷ᵈ goalTy ∷ᵈ "\nSinglePattern:" -- ∷ᵈ {!p!}
-                  ∷ᵈ []) >> error1 "BUG"
-    let varsToUnbind = 0
-    let newCtx = tel'
-    let m = meta x (map-Args (mapVars (_∸ varsToUnbind)) $ take (length ap ∸ varsToUnbind) ap)
-    debugLog1 "New context:"
-    logContext newCtx
-    goalTy' ← extendContext' newCtx $ inferType m
-    return (goalTy' , newCtx)
-
-  ContextMonad-MonadTC : ContextMonad M
-  ContextMonad-MonadTC .introPatternM pat x = do
-    goalTy ← goalTy
-    (newGoalTy , newContext) ← specializeType pat goalTy
-    extendContext' newContext (runWithGoalTy newGoalTy x)
-
-module ClauseExprM {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ _ : ContextMonad M ⦄ where
-
-  instance _ = Functor-M {M = M}
-
-  -- Construct a ClauseExpr in M and extend the context appropriately
-  matchExprM : List (SinglePattern × M (ClauseExpr ⊎ Maybe Term)) → M ClauseExpr
-  matchExprM = _<$>_ MatchExpr ∘ traverse (λ (a , b) → (a ,_) <$> introPatternM a b)
-
-  multiMatchExprM : List (NE.List⁺ SinglePattern × M (ClauseExpr ⊎ Maybe Term)) → M ClauseExpr
-  multiMatchExprM = matchExprM ∘ Data.List.map helper
-    where
-      helper' : (List SinglePattern × M (ClauseExpr ⊎ Maybe Term)) → M (ClauseExpr ⊎ Maybe Term)
-      helper' ([]     , e) = e
-      helper' (p ∷ ps , e) = inj₁ <$> (matchExprM [ p , helper' (ps , e) ])
-
-      helper : (NE.List⁺ SinglePattern × M (ClauseExpr ⊎ Maybe Term)) → SinglePattern × M (ClauseExpr ⊎ Maybe Term)
-      helper (p NE.∷ ps , e) = (p , helper' (ps , e))
-
-  singleMatchExpr : SinglePattern → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
-  singleMatchExpr p x = matchExprM [ p , x ]
-
-  singleTelescopeMatchExpr : NE.List⁺ SinglePattern → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
-  singleTelescopeMatchExpr (p NE.∷ ps) x = helper p ps x
-    where
-      helper : SinglePattern → List SinglePattern → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
-      helper p [] x = singleMatchExpr p x
-      helper p (p' ∷ ps) x = singleMatchExpr p $ inj₁ <$> helper p' ps x
-
-  introExpr : Arg String → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
-  introExpr n x = singleMatchExpr (varSinglePattern n) x
-
-  introsExpr : NE.List⁺ (Arg String) → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
-  introsExpr (p NE.∷ ps) x = helper p ps x
-    where
-      helper : Arg String → List (Arg String) → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
-      helper n [] x = introExpr n x
-      helper n (n' ∷ ns) x = introExpr n $ inj₁ <$> helper n ns x
-
-  contMatch : M ClauseExpr → M (ClauseExpr ⊎ Maybe Term)
-  contMatch expr = inj₁ <$> expr
-
-  finishMatch : M Term → M (ClauseExpr ⊎ Maybe Term)
-  finishMatch t = (inj₂ ∘ just) <$> t
-
-  bindCtxMatchExpr : ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄
-                   → M ClauseExpr → M ClauseExpr
-  bindCtxMatchExpr x = do
-    e ← ctxSinglePatterns
-    case NE.fromList e of λ where
-      (just e') → singleTelescopeMatchExpr e' $ contMatch x
-      nothing → x
-
-clauseTelescope : Clause → List (String × Arg Type)
-clauseTelescope (Clause.clause tel _ _) = tel
-clauseTelescope (Clause.absurd-clause tel _) = tel
-
-module _ where
-  open ClauseExprM ⦃ Monad-Id ⦄ ⦃ ContextMonad-Id ⦄
-
-  instanciatePattern : SinglePattern → List (Arg Type)
-  instanciatePattern p = proj₂ <$>
-    (clauseTelescope $ from-just $ head $ clauseExprToClauses $ singleMatchExpr p $ finishMatch unknown)
-
-  instanciatePatterns : List SinglePattern → Term → List Clause
-  instanciatePatterns [] t = [ Clause.clause [] [] t ]
-  instanciatePatterns (x ∷ ps) t =
-    clauseExprToClauses $ singleTelescopeMatchExpr (x NE.∷ ps) (finishMatch t)
-
-ctxBindingClause : Term → TC Clause
-ctxBindingClause t = do
-  pats ← ctxSinglePatterns
-  (c ∷ _) ← return $ instanciatePatterns (reverse pats) t
-    where _ → error1 "Bug in ctxBindingClause"
-  return c
+open import Class.Show
+open import Class.DecEq
+open import Class.Functor
+open import Class.MonadError.Instances
+open import Class.MonadReader.Instances
+open import Class.MonadTC.Instances
+open import Class.Traversable
+
+module _ where
+  open import Class.Monad hiding (Monad-List) public
+
+import Class.Monad
+
+private variable
+  a b : Level
+  A : Set a
+
+open import Data.String as S using (parens)
+
+showPattern : Pattern → String
+showPattern (con c []) = "con" <+> show c
+showPattern (con c ps) = parens ("con" <+> show c <+> show ps)
+showPattern (dot t)    = "." S.++ parens (show t)
+showPattern (var x)    = "pat-var" <+> show x
+showPattern (lit l)    = show l
+showPattern (proj f)   = show f
+showPattern (absurd _) = "()"
+
+
+record ClauseBuilder (M : Set → Set) : Set₁ where
+  field
+    Base : Set → Set
+    liftBase : Base A → M A
+    addPattern : List (String × Arg Type) → Arg Pattern → M A → M A
+    toClause : M (Maybe Term) → Base Clause
+
+open ClauseBuilder {{...}} public
+
+SinglePattern : Set
+SinglePattern = List (String × Arg Type) × Arg Pattern
+
+typedVarSinglePattern : String → Arg Type → SinglePattern
+typedVarSinglePattern n t@(arg i _) = ([ n , t ] , arg i (` 0))
+
+varSinglePattern : Arg String → SinglePattern
+varSinglePattern (arg i n) = ([ n , arg i unknown ] , arg i (` 0))
+
+multiSinglePattern : List String → Arg Pattern → SinglePattern
+multiSinglePattern s p = ((_, vArg unknown) <$> s) , p
+
+findIndexDefault : List ℕ → ℕ → ℕ → ℕ
+findIndexDefault l d a with filter (λ where (i , x) → x ≟ a) (zipWithIndex _,_ l)
+... | []          = d
+... | (i , _) ∷ _ = i
+
+singlePatternFromPattern : Arg Pattern → SinglePattern
+singlePatternFromPattern (arg i p) =
+  replicate (length (appearingIndices p)) ("" , vArg unknown) , arg i (replacePatternIndex p)
+  where
+    appearingIndices : Pattern → List ℕ
+    appearingIndicesHelper : List (Arg Pattern) → List ℕ
+
+    appearingIndices (Pattern.con c ps) = appearingIndicesHelper ps
+    appearingIndices (Pattern.dot t) = [] -- TODO: this is probably wrong
+    appearingIndices (` x) = [ x ]
+    appearingIndices (Pattern.lit l) = []
+    appearingIndices (Pattern.proj f) = []
+    appearingIndices (Pattern.absurd x) = []
+
+    appearingIndicesHelper [] = []
+    appearingIndicesHelper (arg _ p ∷ ps) = appearingIndices p ++ appearingIndicesHelper ps
+
+    normalisedIndexList : List ℕ
+    normalisedIndexList = sort $ deduplicate _≟_ $ appearingIndices p
+
+    replacePatternIndex : Pattern → Pattern
+    replacePatternIndexHelper : List (Arg Pattern) → List (Arg Pattern)
+
+    replacePatternIndex (Pattern.con c ps) = Pattern.con c (replacePatternIndexHelper ps)
+    replacePatternIndex (Pattern.dot t) = Pattern.dot t
+    replacePatternIndex (` x) = ` findIndexDefault normalisedIndexList 0 x
+    replacePatternIndex (Pattern.lit l) = Pattern.lit l
+    replacePatternIndex (Pattern.proj f) = Pattern.proj f
+    replacePatternIndex (Pattern.absurd x) = Pattern.absurd x
+
+    replacePatternIndexHelper [] = []
+    replacePatternIndexHelper (arg i p ∷ ps) = (arg i (replacePatternIndex p)) ∷ (replacePatternIndexHelper ps)
+
+module _ {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄ where
+
+  instance _ = Functor-M {M = M}
+
+  ctxSinglePatterns : M (List SinglePattern)
+  ctxSinglePatterns = do
+    ctx ← getContext
+    return (singlePatternFromPattern <$> zipWithIndex (λ where k (_ , (arg i _)) → arg i (` k)) ctx)
+
+  -- TODO: add the ability to match initial hidden arguments
+  -- TODO: add dot patterns
+  constrToPattern : Name → Type → M SinglePattern
+  constrToPattern n ty = do
+    (introTel , _) ← viewTy <$> (runAndReset $ local (λ env → record env { normalisation = true }) $ inferType (n ◆))
+    let patternTel = zipWith (λ where (abs _ (arg i _)) k → arg i (` k)) introTel $ downFrom $ length introTel
+    return (((λ where (abs s (arg i t)) → (s , arg i unknown)) <$> introTel) , (vArg $ Pattern.con n patternTel))
+
+  -- like constrToPattern, but applied to parameters
+  constrToPatternTyped : Name → List Term → M SinglePattern
+  constrToPatternTyped n ps = do
+    t ← applyWithVisibility n ps
+    debugLogᵐ (t ᵛⁿ ∷ᵈᵐ []ᵐ)
+    (introTel , _) ← viewTy <$> (local (λ env → record env { normalisation = true }) $ inferType t)
+    let patternTel = zipWith (λ where (abs _ (arg i _)) k → arg i (` k)) introTel $ downFrom $ length introTel
+    return (((λ where (abs s (arg i t)) → (s , arg i t)) <$> introTel) , (vArg $ Pattern.con n patternTel))
+
+  -- all possible patterns for an inductive type
+  constructorPatterns : Arg Type → M (List SinglePattern)
+  constructorPatterns (arg i ty) = do
+    constrs ← getConstrsForType ty
+    return $ constrs <&> λ where
+      (n , t) → let argInfo = proj₁ $ viewTy t
+        in (((λ where (abs n' t') → n' , t') <$> argInfo)
+           , arg i (Pattern.con n (zipWithIndex (λ where k (abs _ (arg i _)) → arg i (` (length argInfo ∸ ℕ.suc k))) argInfo)))
+
+  -- all possible patterns for an inductive type
+  constructorPatterns' : Type → M (List SinglePattern)
+  constructorPatterns' ty = do
+    constrs ← getConstrsForType ty
+    traverse (λ (n , _) → constrToPattern n ty) constrs
+
+  -- all possible patterns for an inductive type
+  constructorPatternsTyped : Type → List Type → M (List SinglePattern)
+  constructorPatternsTyped ty ps = do
+    constrs ← getConstrsForType ty
+    traverse (λ (n , _) → constrToPatternTyped n ps) constrs
+
+ClauseInfo : Set
+ClauseInfo = List SinglePattern
+
+data ClauseExpr : Set where
+  MatchExpr : List (SinglePattern × (ClauseExpr ⊎ Maybe Term)) → ClauseExpr
+
+multiClauseExpr : List (NE.List⁺ SinglePattern × (ClauseExpr ⊎ Maybe Term)) → ClauseExpr
+multiClauseExpr = MatchExpr ∘ Data.List.map helper
+  where
+    helper' : (List SinglePattern × (ClauseExpr ⊎ Maybe Term)) → ClauseExpr ⊎ Maybe Term
+    helper' ([]     , e) = e
+    helper' (p ∷ ps , e) = inj₁ (MatchExpr [ p , helper' (ps , e) ])
+
+    helper : (NE.List⁺ SinglePattern × (ClauseExpr ⊎ Maybe Term)) → SinglePattern × (ClauseExpr ⊎ Maybe Term)
+    helper (p NE.∷ ps , e) = p , helper' (ps , e)
+
+clauseExprToClauseInfo : ClauseExpr → List (ClauseInfo × Maybe Term)
+clauseExprToClauseInfo (MatchExpr []) = []
+clauseExprToClauseInfo (MatchExpr ((p , inj₁ e) ∷ xs)) =
+  (map₁ (p ∷_) <$> clauseExprToClauseInfo e) ++ clauseExprToClauseInfo (MatchExpr xs)
+clauseExprToClauseInfo (MatchExpr ((p , inj₂ t) ∷ xs)) = ([ p ] , t) ∷ clauseExprToClauseInfo (MatchExpr xs)
+
+clauseInfoToClauseArgs : ClauseInfo → List (String × Arg Type) × List (Arg Pattern)
+clauseInfoToClauseArgs i =
+  case helper 0 i of λ where (tel , ps , _) → (tel , ps)
+  where
+    helper : ℕ → ClauseInfo → List (String × Arg Type) × List (Arg Pattern) × ℕ
+    helper k [] = ([] , [] , k)
+    helper k ((tel' , arg h p) ∷ i) with helper k i
+    ... | (tel , ps , k') = (tel' ++ tel , arg h (mapVariables (_+ k') p) ∷ ps , length tel' + k')
+
+clauseInfoToClause : ClauseInfo → Maybe Term → Clause
+clauseInfoToClause i t with clauseInfoToClauseArgs i | t
+... | tel , ps | just x  = Clause.clause tel ps x
+... | tel , ps | nothing = Clause.absurd-clause tel ps
+
+clauseExprToClauses : ClauseExpr → List Clause
+clauseExprToClauses e = (λ { (i , t) → clauseInfoToClause i t }) <$> clauseExprToClauseInfo e
+
+nonBindingClause : Term → Clause
+nonBindingClause = Clause.clause [] []
+
+clauseExprToPatLam : ClauseExpr → Term
+clauseExprToPatLam e = pat-lam (clauseExprToClauses e) []
+
+record ContextMonad (M : ∀ {a} → Set a → Set a) ⦃ _ : Monad M ⦄ : Setω where
+  field
+    introPatternM : SinglePattern → M A → M A
+
+  extendContextM : Arg Type → M A → M A
+  extendContextM l x = introPatternM (typedVarSinglePattern "" l) x
+
+open ContextMonad ⦃...⦄
+
+Monad-Id : Monad id
+Monad-Id .return = id
+Monad-Id ._>>=_  = flip _$_
+
+-- No context
+ContextMonad-Id : ContextMonad id ⦃ Monad-Id ⦄
+ContextMonad-Id .introPatternM _ a = a
+
+module _ {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄ where
+
+  instance _ = Functor-M {M = M}
+
+  refineWithSingle : (Term → Term) → M Term → M Term
+  refineWithSingle ref x = do
+    goalTy ← goalTy
+    m ← newMeta unknown
+    res ← checkType (ref m) goalTy
+    x' ← runWithHole m x
+    unify m x'
+    return $ ref x'
+
+  caseMatch : Term → M ClauseExpr → M Term
+  caseMatch t expr = debugLog ("Match" ∷ᵈ t ∷ᵈ []) >> (refineWithSingle (quote case_of_ ∙⟦ t ∣_⟧) $
+    (λ expr' → pat-lam (clauseExprToClauses expr') []) <$> expr)
+
+  currentTyConstrPatterns : M (List SinglePattern)
+  currentTyConstrPatterns = do
+    (ty ∷ _ , _) ← viewTy′ <$> goalTy
+      where _ → error1 "currentTyConstrPatterns: Goal type is not a forall!"
+    constructorPatterns' (unArg ty)
+
+stripMetaLambdas : Term → Term
+stripMetaLambdas = helper 0
+  where
+    helper : ℕ → Term → Term
+    helper k (lam _ (abs _ t)) = helper (k + 1) t
+    helper k (meta x as) = meta x $ map-Args (mapVars (_∸ k)) $ take (length as ∸ k) as
+    helper _ _ = unknown
+
+module _ {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄ where
+
+  isProj : Pattern → Bool
+  isProj (Pattern.proj _) = true
+  isProj _                = false
+
+  -- if the goal is of type (a : A) → B, return the type of the branch of pattern p and new context
+  specializeType : SinglePattern → Type → M (Type × Telescope)
+  specializeType p@(t , arg i p') goalTy = inDebugPath "specializeType" $ runAndReset do
+    debugLog ("Goal type to specialize: " ∷ᵈ goalTy ∷ᵈ [])
+    cls@((Clause.clause tel _ _) ∷ _) ← return $ clauseExprToClauses $ MatchExpr $
+        (p , inj₂ (just unknown)) ∷
+        (if isProj p' then [] else [ varSinglePattern (arg i "_") , inj₂ (just unknown) ])
+      where _ → error1 "BUG"
+    debugLog ("With pattern: " ∷ᵈ cls ∷ᵈ [])
+    debugLog (showPattern p' ∷ᵈ [])
+    (pat-lam (cl@(Clause.clause tel' _ (meta x ap)) ∷ _) []) ← checkType (pat-lam cls []) goalTy
+      where t → debugLog ("BUG in specializeType:" ∷ᵈ t ∷ᵈ "\nWith pattern:" ∷ᵈ cls
+                  ∷ᵈ "\nWith type:" ∷ᵈ goalTy ∷ᵈ "\nSinglePattern:" -- ∷ᵈ {!p!}
+                  ∷ᵈ []) >> error1 "BUG"
+    let varsToUnbind = 0
+    let newCtx = tel'
+    let m = meta x (map-Args (mapVars (_∸ varsToUnbind)) $ take (length ap ∸ varsToUnbind) ap)
+    debugLog1 "New context:"
+    logContext newCtx
+    goalTy' ← extendContext' newCtx $ inferType m
+    return (goalTy' , newCtx)
+
+  ContextMonad-MonadTC : ContextMonad M
+  ContextMonad-MonadTC .introPatternM pat@(_ , arg _ p) x = do
+    goalTy ← goalTy
+    (newGoalTy , newContext) ← specializeType pat goalTy
+    extendContext' newContext (runWithGoalTy newGoalTy x)
+
+module ClauseExprM {M : ∀ {a} → Set a → Set a} ⦃ _ : Monad M ⦄ ⦃ _ : ContextMonad M ⦄ where
+
+  instance _ = Functor-M {M = M}
+
+  -- Construct a ClauseExpr in M and extend the context appropriately
+  matchExprM : List (SinglePattern × M (ClauseExpr ⊎ Maybe Term)) → M ClauseExpr
+  matchExprM = _<$>_ MatchExpr ∘ traverse (λ (a , b) → (a ,_) <$> introPatternM a b)
+
+  multiMatchExprM : List (NE.List⁺ SinglePattern × M (ClauseExpr ⊎ Maybe Term)) → M ClauseExpr
+  multiMatchExprM = matchExprM ∘ Data.List.map helper
+    where
+      helper' : (List SinglePattern × M (ClauseExpr ⊎ Maybe Term)) → M (ClauseExpr ⊎ Maybe Term)
+      helper' ([]     , e) = e
+      helper' (p ∷ ps , e) = inj₁ <$> (matchExprM [ p , helper' (ps , e) ])
+
+      helper : (NE.List⁺ SinglePattern × M (ClauseExpr ⊎ Maybe Term)) → SinglePattern × M (ClauseExpr ⊎ Maybe Term)
+      helper (p NE.∷ ps , e) = (p , helper' (ps , e))
+
+  singleMatchExpr : SinglePattern → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
+  singleMatchExpr p x = matchExprM [ p , x ]
+
+  singleTelescopeMatchExpr : NE.List⁺ SinglePattern → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
+  singleTelescopeMatchExpr (p NE.∷ ps) x = helper p ps x
+    where
+      helper : SinglePattern → List SinglePattern → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
+      helper p [] x = singleMatchExpr p x
+      helper p (p' ∷ ps) x = singleMatchExpr p $ inj₁ <$> helper p' ps x
+
+  introExpr : Arg String → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
+  introExpr n x = singleMatchExpr (varSinglePattern n) x
+
+  introsExpr : NE.List⁺ (Arg String) → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
+  introsExpr (p NE.∷ ps) x = helper p ps x
+    where
+      helper : Arg String → List (Arg String) → M (ClauseExpr ⊎ Maybe Term) → M ClauseExpr
+      helper n [] x = introExpr n x
+      helper n (n' ∷ ns) x = introExpr n $ inj₁ <$> helper n ns x
+
+  contMatch : M ClauseExpr → M (ClauseExpr ⊎ Maybe Term)
+  contMatch expr = inj₁ <$> expr
+
+  finishMatch : M Term → M (ClauseExpr ⊎ Maybe Term)
+  finishMatch t = (inj₂ ∘ just) <$> t
+
+  bindCtxMatchExpr : ⦃ me : MonadError (List ErrorPart) M ⦄ ⦃ mre : MonadReader TCEnv M ⦄ ⦃ _ : MonadTC M ⦄
+                   → M ClauseExpr → M ClauseExpr
+  bindCtxMatchExpr x = do
+    e ← ctxSinglePatterns
+    case NE.fromList e of λ where
+      (just e') → singleTelescopeMatchExpr e' $ contMatch x
+      nothing → x
+
+clauseTelescope : Clause → List (String × Arg Type)
+clauseTelescope (Clause.clause tel _ _) = tel
+clauseTelescope (Clause.absurd-clause tel _) = tel
+
+module _ where
+  open ClauseExprM ⦃ Monad-Id ⦄ ⦃ ContextMonad-Id ⦄
+
+  instanciatePattern : SinglePattern → List (Arg Type)
+  instanciatePattern p = proj₂ <$>
+    (clauseTelescope $ from-just $ head $ clauseExprToClauses $ singleMatchExpr p $ finishMatch unknown)
+
+  instanciatePatterns : List SinglePattern → Term → List Clause
+  instanciatePatterns [] t = [ Clause.clause [] [] t ]
+  instanciatePatterns (x ∷ ps) t =
+    clauseExprToClauses $ singleTelescopeMatchExpr (x NE.∷ ps) (finishMatch t)
+
+ctxBindingClause : Term → TC Clause
+ctxBindingClause t = do
+  pats ← ctxSinglePatterns
+  (c ∷ _) ← return $ instanciatePatterns (reverse pats) t
+    where _ → error1 "Bug in ctxBindingClause"
+  return c
 

\ No newline at end of file
diff --git a/Tactic.Constrs.html b/Tactic.Constrs.html
index 0fea6cf..939dea2 100644
--- a/Tactic.Constrs.html
+++ b/Tactic.Constrs.html
@@ -1,5 +1,5 @@
 
-Tactic.ConstrsSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.ConstrsSource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- tryConstrs: Try to refine the goal with constructors recursively,
 -- applying some other tactic at the leaves
@@ -33,28 +33,28 @@
 
 tryConstrsWith' : ℕ → ITactic → ITactic
 tryConstrsWith' zero        tac =
-  inDebugPath "tryConstrs" $ catch tac (λ _ → error1 "Maximum depth reached!")
+  inDebugPath "tryConstrs" $ catch tac (λ _ → error1 "Maximum depth reached!")
 tryConstrsWith' (suc depth) tac =
   inDebugPath "tryConstrs" $ catch tac λ _ → do
-  inj₁ goal ← reader TCEnv.goal
-    where _ → error1 "Goal is not a hole!"
-  goalTy ← inferType goal
-  debugLog ("Find constructor for type " ∷ᵈ goalTy ∷ᵈ [])
-  constrs ← getConstrsForTerm goal
-  try (Data.List.map (λ constr → do
-      debugLog ("Try constructor " ∷ᵈ proj₁ constr ∷ᵈ " of type: " ∷ᵈ proj₂ constr ∷ᵈ [])
+  inj₁ goal ← reader TCEnv.goal
+    where _ → error1 "Goal is not a hole!"
+  goalTy ← inferType goal
+  debugLog ("Find constructor for type " ∷ᵈ goalTy ∷ᵈ [])
+  constrs ← getConstrsForTerm goal
+  try (Data.List.map (λ constr → do
+      debugLog ("Try constructor " ∷ᵈ proj₁ constr ∷ᵈ " of type: " ∷ᵈ proj₂ constr ∷ᵈ [])
       let t = uncurry applyConstrToUnknowns constr
-      t' ← local (λ env → record env { reconstruction = true }) $ checkType t goalTy
-      unify goal t'
-      debugLog1 "Success!"
-      traverse ⦃ Class.Functor.Instances.Functor-List ⦄ (λ t → runWithHole t (tryConstrsWith' depth tac)) (findMetas t')
+      t' ← local (λ env → record env { reconstruction = true }) $ checkType t goalTy
+      unify goal t'
+      debugLog1 "Success!"
+      traverse ⦃ Class.Functor.Instances.Functor-List ⦄ (λ t → runWithHole t (tryConstrsWith' depth tac)) (findMetas t')
       return tt)
     constrs)
-    (logAndError1 "No constructors were able to solve the goal!")
+    (logAndError1 "No constructors were able to solve the goal!")
 
-module _ ⦃ _ : TCOptions ⦄ where
+module _ ⦃ _ : TCOptions ⦄ where
   tryConstrsᵗ : ℕ → Tactic
-  tryConstrsᵗ n = initTac $ tryConstrsWith' n (error1 "Leaf reached!")
+  tryConstrsᵗ n = initTac $ tryConstrsWith' n (error1 "Leaf reached!")
 
   macro
     tryConstrsWith = λ n tac → initTac $ tryConstrsWith' n tac
@@ -69,7 +69,7 @@
     open import Relation.Binary.PropositionalEquality
 
     startDebug : ⊤
-    startDebug = byTC (debugLog1 "\n\n\n\nTesting 'tryConstrs'\n")
+    startDebug = byTC (debugLog1 "\n\n\n\nTesting 'tryConstrs'\n")
 
     test₁ : (3 ≡ 3) × (1 + 1 ≡ 2)
     test₁ = tryConstrs 2
@@ -84,5 +84,5 @@
     test₃ = tryConstrs 2
 
     test₄ : ∀ {a} {A : Set a} {x y : A} → x ≡ y → (1 ≡ 2) ⊎ (x ≡ y)
-    test₄ h = tryConstrsWith 2 assumption'
+    test₄ h = tryConstrsWith 2 assumption'
 

\ No newline at end of file
diff --git a/Tactic.Defaults.html b/Tactic.Defaults.html
index f1cf1a3..65d2aab 100644
--- a/Tactic.Defaults.html
+++ b/Tactic.Defaults.html
@@ -1,5 +1,5 @@
 
-Tactic.DefaultsSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.DefaultsSource code on Github
{-# OPTIONS --safe --without-K #-}
 module Tactic.Defaults where
 
 open import Meta.Prelude
@@ -11,10 +11,10 @@
 -- to tweak all at once
 instance
   defaultTCOptionsI = record
-    { debug = record defaultDebugOptions
-      { prefix = '┃' -- ┃⎸
-      ; filter = Filter.⊥
+    { debug = record defaultDebugOptions
+      { prefix = '┃' -- ┃⎸
+      ; filter = Filter.⊥
       }
-    ; fuel  = ("reduceDec/constrs" , 5) ∷ []
+    ; fuel  = ("reduceDec/constrs" , 5) ∷ []
     }
 

\ No newline at end of file
diff --git a/Tactic.Derive.DecEq.html b/Tactic.Derive.DecEq.html
index 3663b10..a3988bb 100644
--- a/Tactic.Derive.DecEq.html
+++ b/Tactic.Derive.DecEq.html
@@ -1,5 +1,5 @@
 
-Tactic.Derive.DecEqSource code on Github
-- Deriving decidable equality. This works in several cases that use
+Tactic.Derive.DecEqSource code on Github
-- Deriving decidable equality. This works in several cases that use
 -- mutual recursion, examples are at the bottom.
 --
 -- TODO: This breaks with:
@@ -35,9 +35,9 @@
 open import Tactic.Derive (quote DecEq) (quote _≟_)
 
 instance
-  _ = ContextMonad-MonadTC
+  _ = ContextMonad-MonadTC
 
-open ClauseExprM
+open ClauseExprM
 
 `yes `no : Term → Term
 `yes x = quote _because_ ◆⟦ quote true  ◆ ∣ quote ofʸ ◆⟦ x ⟧ ⟧
@@ -60,15 +60,15 @@
   ... | nothing     = quote _≟_ ∙⟦ t ∣ t' ⟧
   eqFromTerm _ t t' = quote _≟_ ∙⟦ t ∣ t' ⟧
 
-  toDecEqName : SinglePattern → List (Term → Term → Term)
+  toDecEqName : SinglePattern → List (Term → Term → Term)
   toDecEqName (l , _) = L.map (λ where (_ , arg _ t) → eqFromTerm t) l
 
   -- on the diagonal we have one pattern, outside we don't care
   -- assume that the types in the pattern are properly normalized
-  mapDiag : Maybe SinglePattern → TC Term
+  mapDiag : Maybe SinglePattern → TC Term
   mapDiag nothing          = return $ `no `λ⦅ [ ("" , vArg?) ] ⦆∅
   mapDiag (just p@(l , _)) = let k = length l in do
-    typeList ← traverse ⦃ Functor-List ⦄ inferType (applyDownFrom ♯ (length l))
+    typeList ← traverse ⦃ Functor-List ⦄ inferType (applyDownFrom ♯ (length l))
     return $ quote map' ∙⟦ genPf k (L.map eqFromTerm typeList) ∣ genEquiv k ⟧
     where
       genPf : ℕ → List (Term → Term → Term) → Term
@@ -87,13 +87,13 @@
           reflTerm 0       = quote tt ◆
           reflTerm (suc n) = quote _,_ ◆⟦ reflTerm n ∣ quote refl ◆ ⟧
 
-  toMapDiag : SinglePattern → SinglePattern → NE.List⁺ SinglePattern × TC (ClauseExpr ⊎ Maybe Term)
+  toMapDiag : SinglePattern → SinglePattern → NE.List⁺ SinglePattern × TC (ClauseExpr ⊎ Maybe Term)
   toMapDiag p@(_ , arg _ p₁) p'@(_ , arg _ p₂) =
-    (p NE.∷ [ p' ] , finishMatch (if ⌊ p₁ ≟-Pattern p₂ ⌋ then mapDiag (just p) else mapDiag nothing))
+    (p NE.∷ [ p' ] , finishMatch (if ⌊ p₁ ≟-Pattern p₂ ⌋ then mapDiag (just p) else mapDiag nothing))
 
-module _ ⦃ _ : TCOptions ⦄ where
+module _ ⦃ _ : TCOptions ⦄ where
   derive-DecEq : List (Name × Name) → UnquoteDecl
-  derive-DecEq = derive-Class 0 (λ transName ps → cartesianProductWith (toMapDiag transName) ps ps)
+  derive-DecEq = derive-Class 0 (λ transName ps → cartesianProductWith (toMapDiag transName) ps ps)
 
 private
   open import Tactic.Derive.TestTypes
diff --git a/Tactic.Derive.Show.html b/Tactic.Derive.Show.html
index 034a9fc..24f95a0 100644
--- a/Tactic.Derive.Show.html
+++ b/Tactic.Derive.Show.html
@@ -1,5 +1,5 @@
 
-Tactic.Derive.ShowSource code on Github
-- Deriving show.
+Tactic.Derive.ShowSource code on Github
-- Deriving show.
 
 {-# OPTIONS -v allTactics:100 #-}
 {-# OPTIONS --safe #-}
@@ -28,9 +28,9 @@
 open import Tactic.Derive (quote Show) (quote show)
 
 instance
-  _ = ContextMonad-MonadTC
+  _ = ContextMonad-MonadTC
 
-open ClauseExprM
+open ClauseExprM
 
 sLit = Term.lit ∘ Agda.Builtin.Reflection.Literal.string
 
@@ -57,38 +57,41 @@
   genShow n [] = sLit (showName n)
   genShow n (x ∷ l) = quote _<+>_ ∙⟦ genShow n l ∣ genPars x ⟧
 
-  patternToClause : SinglePattern → NE.List⁺ SinglePattern × TC (ClauseExpr ⊎ Maybe Term)
-  patternToClause p@(l , arg _ (Pattern.con n _)) = NE.[ p ] , finishMatch do
-    typeList ← traverse ⦃ Functor-List ⦄ (λ t → do T ← inferType t; return (T , t)) (applyDownFrom ♯ (length l))
+  patternToClause : SinglePattern → NE.List⁺ SinglePattern × TC (ClauseExpr ⊎ Maybe Term)
+  patternToClause p@(l , arg _ (Pattern.con n _)) = NE.[ p ] , finishMatch do
+    typeList ← traverse ⦃ Functor-List ⦄ (λ t → do T ← inferType t; return (T , t)) (applyDownFrom ♯ (length l))
     return $ genShow n (L.map (uncurry showFromTerm) $ reverse typeList)
-  patternToClause p = NE.[ p ] , error1 "Error: not a con!"
+  patternToClause p = NE.[ p ] , error1 "Error: not a con!"
 
-module _ ⦃ _ : TCOptions ⦄ where
+module _ ⦃ _ : TCOptions ⦄ where
   derive-Show : List (Name × Name) → UnquoteDecl
-  derive-Show = derive-Class 0 (λ transName → L.map (patternToClause transName))
+  derive-Show = derive-Class 0 (λ transName → L.map (patternToClause transName))
 
 private
   open import Tactic.Derive.TestTypes
   import Data.Nat.Show
   open import Tactic.Defaults
+  open import Data.List.Relation.Binary.Pointwise.Base
 
-  unquoteDecl Show-Bool Show-ℤ Show-List Show-Maybe Show-ℕ Show-Sign Show-⊤ = derive-Show ((quote Bool , Show-Bool) ∷ (quote ℤ , Show-ℤ) ∷ (quote List , Show-List) ∷ (quote Maybe , Show-Maybe) ∷ (quote ℕ , Show-ℕ) ∷ (quote Sign , Show-Sign) ∷ (quote ⊤ , Show-⊤) ∷ [])
+  unquoteDecl Show-Bool Show-ℤ Show-List Show-Maybe Show-ℕ Show-Sign Show-⊤ = derive-Show ((quote Bool , Show-Bool) ∷ (quote ℤ , Show-ℤ) ∷ (quote List , Show-List) ∷ (quote Maybe , Show-Maybe) ∷ (quote ℕ , Show-ℕ) ∷ (quote Sign , Show-Sign) ∷ (quote ⊤ , Show-⊤) ∷ [])
 
-  unquoteDecl Show-Fin = derive-Show [ (quote Fin , Show-Fin) ]
-  unquoteDecl Show-Vec = derive-Show [ (quote Vec , Show-Vec) ]
+  unquoteDecl Show-Fin = derive-Show [ (quote Fin , Show-Fin) ]
+  unquoteDecl Show-Vec = derive-Show [ (quote Vec , Show-Vec) ]
 
-  unquoteDecl Show-These = derive-Show [ (quote These , Show-These) ]
-  unquoteDecl Show-⊎ = derive-Show [ (quote _⊎_ , Show-⊎) ]
+  unquoteDecl Show-Pointwise = derive-Show [ (quote Pointwise , Show-Pointwise) ]
 
-  unquoteDecl Show-E1 Show-E2 Show-E3 = derive-Show
-    ((quote E1 , Show-E1) ∷ (quote E2 , Show-E2) ∷ (quote E3 , Show-E3) ∷ [])
+  unquoteDecl Show-These = derive-Show [ (quote These , Show-These) ]
+  unquoteDecl Show-⊎ = derive-Show [ (quote _⊎_ , Show-⊎) ]
 
-  -- unquoteDecl Show-E4 = derive-Show [ (quote E4 , Show-E4) ]
+  unquoteDecl Show-E1 Show-E2 Show-E3 = derive-Show
+    ((quote E1 , Show-E1) ∷ (quote E2 , Show-E2) ∷ (quote E3 , Show-E3) ∷ [])
 
-  unquoteDecl Show-R1 Show-R2 = derive-Show
-    ((quote R1 , Show-R1) ∷ (quote R2 , Show-R2) ∷ [])
+  -- unquoteDecl Show-E4 = derive-Show [ (quote E4 , Show-E4) ]
 
-  unquoteDecl Show-M₁ Show-M₂ = derive-Show $ (quote M₁ , Show-M₁) ∷ (quote M₂ , Show-M₂) ∷ []
+  unquoteDecl Show-R1 Show-R2 = derive-Show
+    ((quote R1 , Show-R1) ∷ (quote R2 , Show-R2) ∷ [])
 
-  -- Expected: Show-Product Show-Term
+  unquoteDecl Show-M₁ Show-M₂ = derive-Show $ (quote M₁ , Show-M₁) ∷ (quote M₂ , Show-M₂) ∷ []
+
+  -- Expected: Show-Product Show-Term
 

\ No newline at end of file
diff --git a/Tactic.Derive.TestTypes.html b/Tactic.Derive.TestTypes.html
index 8914d60..4c40a50 100644
--- a/Tactic.Derive.TestTypes.html
+++ b/Tactic.Derive.TestTypes.html
@@ -1,5 +1,5 @@
 
-Tactic.Derive.TestTypesSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.Derive.TestTypesSource code on Github
{-# OPTIONS --safe --without-K #-}
 {-# OPTIONS -v allTactics:100 #-}
 module Tactic.Derive.TestTypes where
 
diff --git a/Tactic.Derive.html b/Tactic.Derive.html
index 370fd3b..427b57c 100644
--- a/Tactic.Derive.html
+++ b/Tactic.Derive.html
@@ -1,5 +1,5 @@
 
-Tactic.DeriveSource code on Github
-- Generic type class dervations. Works with mutually recursive types
+Tactic.DeriveSource code on Github
-- Generic type class dervations. Works with mutually recursive types
 -- and can use mutual recursion to satisfy the termination
 -- checker. Writing an actual derivation strategy then does not
 -- require dealing with any mutual recursion, it is all handled here.
@@ -35,89 +35,106 @@
 open import Tactic.ClauseBuilder
 
 open import Class.DecEq
-open import Class.Monad
-open import Class.Traversable
-open import Class.Functor
-open import Class.MonadReader.Instances
-open import Class.MonadTC.Instances
-
-instance
-  _ = ContextMonad-MonadTC
-  _ = Functor-M
-
-open ClauseExprM
-
-genClassType : ℕ → Name → Maybe Name → TC Type
-genClassType arity dName wName = do
-  params ← getParamsAndIndices dName
-  adjParams ← adjustParams $ take (length params ∸ arity) params
-  debugLog1 "AdjustedParams: "
-  logTelescope (L.map ((λ where (abs s x) → just s , x) ∘ proj₁) adjParams)
-  ty ← applyWithVisibility dName (L.map ♯ (trueIndices adjParams))
-  return $ modifyClassType wName (L.map proj₁ adjParams , ty)
-  where
-    adjustParams : List (Abs (Arg Type)) → TC (List ((Abs (Arg Type)) × Bool))
-    adjustParams [] = return []
-    adjustParams (abs x (arg _ t) ∷ l) = do
-      a ← (if_then [ (abs "_" (iArg (className ∙⟦ ♯ 0 ⟧)) , false) ] else []) <$> isNArySort arity t
-      ps ← extendContext (x , hArg t) (adjustParams l)
-      let ps' = flip L.map ps λ where
-        (abs s (arg i t) , b) → (abs s (arg i (mapVars (_+ (if b then length a else 0)) t)) , b)
-      return (((abs x (hArg t) , true) ∷ a) ++ ps')
-
-    trueIndices : {A : Set} → List (A × Bool) → List ℕ
-    trueIndices [] = []
-    trueIndices (x ∷ l) = if proj₂ x then length l ∷ trueIndices l else trueIndices l
-
-    modifyClassType : Maybe Name → TypeView → Type
-    modifyClassType nothing  (tel , ty) = tyView (tel , className ∙⟦ ty ⟧)
-    modifyClassType (just n) (tel , ty) = tyView (tel , className ∙⟦ n ∙⟦ ty ⟧ ⟧)
-
-lookupName : List (Name × Name) → Name → Maybe Name
-lookupName = lookupᵇ (λ n n' → ⌊ n ≟ n' ⌋)
-
--- Look at the constructors of the argument and return all types that
--- recursively contain it. This isn't very clever right now.
-genMutualHelpers : Name → TC (List Name)
-genMutualHelpers n = do
-  tys ← L.map (unArg ∘ unAbs) <$> (L.concatMap (proj₁ ∘ viewTy ∘ proj₂) <$> getConstrs n)
-  return $ deduplicate _≟_ $ L.mapMaybe helper tys
-  where
-    helper : Type → Maybe Name
-    helper (def n' args) =
-      if L.any (λ where (arg _ (def n'' _)) → ⌊ n ≟ n'' ⌋ ; _ → false) args
-      then just n' else nothing
-    helper _ = nothing
-
-module _ (arity : ℕ) (genCe : (Name → Maybe Name) → List SinglePattern → List (NE.List⁺ SinglePattern × TC (ClauseExpr ⊎ Maybe Term))) where
-  -- Generate the declaration & definition of a particular derivation.
-  --
-  -- Takes a dictionary (for mutual recursion), a wrapper (also for
-  -- mutual recursion), the name of the original type we want to derive
-  -- Show for and the name we want to define Show originally at.
-  deriveSingle : List (Name × Name) → Name → Name → Maybe Name → TC (Arg Name × Type × List Clause)
-  deriveSingle transName dName iName wName = inDebugPath "DeriveSingle" do
-    debugLog ("For: " ∷ᵈ dName ∷ᵈ [])
-    goalTy ← genClassType arity dName wName
-    ps ← constructorPatterns' (fromMaybe dName wName ∙)
-    -- TODO: find a good way of printing this
-    --debugLogᵐ ("Constrs: " ∷ᵈᵐ ps ᵛⁿ ∷ᵈᵐ []ᵐ)
-    cs ← local (λ c → record c { goal = inj₂ goalTy }) $
-      singleMatchExpr ([] , iArg (Pattern.proj projName)) $ contMatch $ multiMatchExprM $
-        genCe (lookupName transName) ps
-    let defName = maybe (maybe vArg (iArg iName) ∘ lookupName transName) (iArg iName) wName
-    return (defName , goalTy , clauseExprToClauses cs)
-
-  deriveMulti : Name × Name × List Name → TC (List (Arg Name × Type × List Clause))
-  deriveMulti (dName , iName , hClasses) = do
-    hClassNames ← traverse ⦃ Functor-List ⦄
-      (λ cn → freshName (showName className S.++ "-" S.++ showName cn S.++ showName dName)) hClasses
-    traverse ⦃ Functor-List ⦄ (deriveSingle (L.zip hClasses hClassNames) dName iName) (nothing ∷ L.map just hClasses)
-
-  derive-Class : ⦃ TCOptions ⦄ → List (Name × Name) → UnquoteDecl
-  derive-Class l = initUnquoteWithGoal (className ∙) $
-    declareAndDefineFuns =<< concat <$> traverse ⦃ Functor-List ⦄ helper l
-    where
-      helper : Name × Name → TC (List (Arg Name × Type × List Clause))
-      helper (a , b) = do hs ← genMutualHelpers a ; deriveMulti (a , b , hs)
+open import Class.Functor
+open import Class.Monad
+open import Class.MonadReader.Instances
+open import Class.MonadTC.Instances
+open import Class.Show
+open import Class.Traversable
+
+instance
+  _ = ContextMonad-MonadTC
+  _ = Functor-M
+  _ = Show-List
+
+open ClauseExprM
+
+-- generate the type of the `className dName` instance
+genClassType : ℕ → Name → Maybe Name → TC Type
+genClassType arity dName wName = do
+  params ← getParamsAndIndices dName
+  let params' = L.map (λ where (abs x y) → abs x (hide y)) $ take (length params ∸ arity) params
+  sorts ← collectRelevantSorts params'
+  debugLog1 ("Generate required instances at indices: " S.++ show (L.map proj₁ sorts))
+  let adjustedDBs = L.zipWith (λ (i , tel) a → (i + a , tel)) sorts (upTo (length sorts))
+  adjustedDBs' ← extendContext' (toTelescope params) $ genSortInstanceWithCtx adjustedDBs
+  let adjParams = params' ++ adjustedDBs'
+  debugLog1 "AdjustedParams: "
+  logTelescope (L.map ((λ where (abs s x) → just s , x)) adjParams)
+  ty ← applyWithVisibility dName (L.map (♯ ∘ (_+ length sorts)) (downFrom (length params)))
+  return $ modifyClassType wName (adjParams , ty)
+  where
+    -- returns list of DB indices (at the end) and telescope of argument types
+    collectRelevantSorts : List (Abs (Arg Type)) → TC (List (ℕ × ℕ))
+    collectRelevantSorts [] = return []
+    collectRelevantSorts (abs x (arg _ t) ∷ l) = do
+      rec ← extendContext (x , hArg t) $ collectRelevantSorts l
+      (b , k) ← isNArySort t
+      return (if b then (length l , k) ∷ rec else rec)
+
+    genSortInstance : ℕ → ℕ → ℕ → TC Term
+    genSortInstance k 0 i       = do
+      res ← applyWithVisibilityDB (i + k) (L.map ♯ $ downFrom k)
+      return $ className ∙⟦ res ⟧
+    genSortInstance k (suc a) i = do
+      res ← extendContext ("" , hArg unknown) $ genSortInstance k a i
+      return $ pi (hArg unknown) $ abs "_" res
+
+    genSortInstanceWithCtx : List (ℕ × ℕ) → TC (List (Abs (Arg Term)))
+    genSortInstanceWithCtx [] = return []
+    genSortInstanceWithCtx ((i , k) ∷ xs) = do
+      x' ← (abs "_" ∘ iArg) <$> (genSortInstance k k i)
+      (x' ∷_) <$> (extendContext ("", hArg unknown) $ genSortInstanceWithCtx xs)
+
+    modifyClassType : Maybe Name → TypeView → Type
+    modifyClassType nothing  (tel , ty) = tyView (tel , className ∙⟦ ty ⟧)
+    modifyClassType (just n) (tel , ty) = tyView (tel , className ∙⟦ n ∙⟦ ty ⟧ ⟧)
+
+lookupName : List (Name × Name) → Name → Maybe Name
+lookupName = lookupᵇ (λ n n' → ⌊ n ≟ n' ⌋)
+
+-- Look at the constructors of the argument and return all types that
+-- recursively contain it. This isn't very clever right now.
+genMutualHelpers : Name → TC (List Name)
+genMutualHelpers n = do
+  tys ← L.map (unArg ∘ unAbs) <$> (L.concatMap (proj₁ ∘ viewTy ∘ proj₂) <$> getConstrs n)
+  return $ deduplicate _≟_ $ L.mapMaybe helper tys
+  where
+    helper : Type → Maybe Name
+    helper (def n' args) =
+      if L.any (λ where (arg _ (def n'' _)) → ⌊ n ≟ n'' ⌋ ; _ → false) args
+      then just n' else nothing
+    helper _ = nothing
+
+module _ (arity : ℕ) (genCe : (Name → Maybe Name) → List SinglePattern → List (NE.List⁺ SinglePattern × TC (ClauseExpr ⊎ Maybe Term))) where
+  -- Generate the declaration & definition of a particular derivation.
+  --
+  -- Takes a dictionary (for mutual recursion), a wrapper (also for
+  -- mutual recursion), the name of the original type we want to derive
+  -- Show for and the name we want to define Show originally at.
+  deriveSingle : List (Name × Name) → Name → Name → Maybe Name → TC (Arg Name × Type × List Clause)
+  deriveSingle transName dName iName wName = inDebugPath "DeriveSingle" do
+    debugLog ("For: " ∷ᵈ dName ∷ᵈ [])
+    goalTy ← genClassType arity dName wName
+    ps ← constructorPatterns' (fromMaybe dName wName ∙)
+    -- TODO: find a good way of printing this
+    --debugLogᵐ ("Constrs: " ∷ᵈᵐ ps ᵛⁿ ∷ᵈᵐ []ᵐ)
+    cs ← local (λ c → record c { goal = inj₂ goalTy }) $
+      singleMatchExpr ([] , iArg (Pattern.proj projName)) $ contMatch $ multiMatchExprM $
+        genCe (lookupName transName) ps
+    let defName = maybe (maybe vArg (iArg iName) ∘ lookupName transName) (iArg iName) wName
+    return (defName , goalTy , clauseExprToClauses cs)
+
+  deriveMulti : Name × Name × List Name → TC (List (Arg Name × Type × List Clause))
+  deriveMulti (dName , iName , hClasses) = do
+    hClassNames ← traverse ⦃ Functor-List ⦄
+      (λ cn → freshName (showName className S.++ "-" S.++ showName cn S.++ showName dName)) hClasses
+    traverse ⦃ Functor-List ⦄ (deriveSingle (L.zip hClasses hClassNames) dName iName) (nothing ∷ L.map just hClasses)
+
+  derive-Class : ⦃ TCOptions ⦄ → List (Name × Name) → UnquoteDecl
+  derive-Class l = initUnquoteWithGoal (className ∙) $
+    declareAndDefineFuns =<< runAndReset (concat <$> traverse ⦃ Functor-List ⦄ helper l)
+    where
+      helper : Name × Name → TC (List (Arg Name × Type × List Clause))
+      helper (a , b) = do hs ← genMutualHelpers a ; deriveMulti (a , b , hs)
 

\ No newline at end of file
diff --git a/Tactic.EquationalReasoning.html b/Tactic.EquationalReasoning.html
index 46d3b2d..17c46a4 100644
--- a/Tactic.EquationalReasoning.html
+++ b/Tactic.EquationalReasoning.html
@@ -1,5 +1,5 @@
 
-Tactic.EquationalReasoningSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.EquationalReasoningSource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- equational reasoning that can use tactics at each step
 --------------------------------------------------------------------------------
diff --git a/Tactic.Eta.html b/Tactic.Eta.html
index 7a24bb4..49b1759 100644
--- a/Tactic.Eta.html
+++ b/Tactic.Eta.html
@@ -1,5 +1,5 @@
 
-Tactic.EtaSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.EtaSource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- eta: unify with an eta-expanded version of the argument
 --------------------------------------------------------------------------------
@@ -24,20 +24,20 @@
 saturate : Term → Args Type → TC Term
 saturate f as = case f of λ where
   (def c as′) → return $ def c (as′ ++ as)
-  _           → error1 $ "cannot saturate arbitrary expressions, only definitions"
+  _           → error1 $ "cannot saturate arbitrary expressions, only definitions"
 
 macro
-  η : ⦃ TCOptions ⦄ → Term → Tactic
+  η : ⦃ TCOptions ⦄ → Term → Tactic
   η f = initTac $ inDebugPath "eta" do
-    debugLog ("f: " ∷ᵈ f ∷ᵈ [])
-    ty ← inferType f -- =<< reduce f
-    debugLog ("ty: " ∷ᵈ ty ∷ᵈ [])
+    debugLog ("f: " ∷ᵈ f ∷ᵈ [])
+    ty ← inferType f -- =<< reduce f
+    debugLog ("ty: " ∷ᵈ ty ∷ᵈ [])
     let as , _ = viewTy′ ty
-    debugLog ("as: " ∷ᵈ show as ∷ᵈ [])
+    debugLog ("as: " ∷ᵈ show as ∷ᵈ [])
     f′ ← saturate f $ flip map (enumerate as) $ λ where
       (n , arg i _) → arg i (♯ (length as ∸ suc n))
-    debugLog ("f′: " ∷ᵈ show f′ ∷ᵈ [])
-    unifyWithGoal $ foldr (λ x t → Π[ "_" ∶ x ] t) f′ as
+    debugLog ("f′: " ∷ᵈ show f′ ∷ᵈ [])
+    unifyWithGoal $ foldr (λ x t → Π[ "_" ∶ x ] t) f′ as
 
 
 private
diff --git a/Tactic.Existentials.html b/Tactic.Existentials.html
index 9b51b53..d22d242 100644
--- a/Tactic.Existentials.html
+++ b/Tactic.Existentials.html
@@ -1,5 +1,5 @@
 
-Tactic.ExistentialsSource code on Github
module Tactic.Existentials where
+Tactic.ExistentialsSource code on Github
module Tactic.Existentials where
 
 open import Meta.Prelude
 
diff --git a/Tactic.Extra.html b/Tactic.Extra.html
index bf28a9b..1848e4f 100644
--- a/Tactic.Extra.html
+++ b/Tactic.Extra.html
@@ -1,5 +1,5 @@
 
-Tactic.ExtraSource code on Github
{-# OPTIONS -v extra:100 #-}
+Tactic.ExtraSource code on Github
{-# OPTIONS -v extra:100 #-}
 module Tactic.Extra where
 
 open import Meta.Prelude
diff --git a/Tactic.Intro.html b/Tactic.Intro.html
index a91c055..3c6fe8f 100644
--- a/Tactic.Intro.html
+++ b/Tactic.Intro.html
@@ -1,5 +1,5 @@
 
-Tactic.IntroSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.IntroSource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- intro, intros: introduce one or many variables & continue with another tactic
 --------------------------------------------------------------------------------
@@ -18,20 +18,20 @@
 private
   introHelper : ITactic → TC ⊤ → ITactic
   introHelper tac fail = do
-    hole ← goalHole
-    ty ← inferType hole
+    hole ← goalHole
+    ty ← inferType hole
     case ty of λ where
       (pi argTy@(arg (arg-info v _) _) (abs x ty′)) → do
-        hole′ ← extendContext (x , argTy) (newMeta ty′)
+        hole′ ← extendContext (x , argTy) (newMeta ty′)
         unifyStrict (hole , ty) (lam v (abs "_" hole′))
-        extendContext (x , argTy) (runWithHole hole′ tac)
+        extendContext (x , argTy) (runWithHole hole′ tac)
       _ → fail
 
 intro : ITactic → ITactic
-intro tac = inDebugPath "intro" (introHelper tac (error1 "intro: not a pi type"))
+intro tac = inDebugPath "intro" (introHelper tac (error1 "intro: not a pi type"))
 
 intros : ℕ → ITactic → ITactic
-intros 0       tac = error1 "intros: no more fuel"
+intros 0       tac = error1 "intros: no more fuel"
 intros (suc k) tac = inDebugPath "intros" (introHelper (intros k tac) tac)
 
 private
@@ -39,11 +39,11 @@
   open import Tactic.Defaults
 
   macro
-    intro→fill : ⦃ TCOptions ⦄ → Tactic
-    intro→fill = initTac ⦃ defaultTCOptionsI ⦄ $ intro assumption'
+    intro→fill : ⦃ TCOptions ⦄ → Tactic
+    intro→fill = initTac ⦃ defaultTCOptionsI ⦄ $ intro assumption'
 
-    intros→fill : ⦃ TCOptions ⦄ → Tactic
-    intros→fill = initTac ⦃ defaultTCOptionsI ⦄ $ intros 5 assumption'
+    intros→fill : ⦃ TCOptions ⦄ → Tactic
+    intros→fill = initTac ⦃ defaultTCOptionsI ⦄ $ intros 5 assumption'
 
   _ : ℕ → ℕ
   _ = intro→fill
diff --git a/Tactic.MonoidSolver.html b/Tactic.MonoidSolver.html
index 66e0ed1..3a7a61e 100644
--- a/Tactic.MonoidSolver.html
+++ b/Tactic.MonoidSolver.html
@@ -1,5 +1,5 @@
 
-Tactic.MonoidSolverSource code on Github
------------------------------------------------------------------------
+Tactic.MonoidSolverSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Reflection-based solver for monoid equalities
diff --git a/Tactic.ReduceDec.html b/Tactic.ReduceDec.html
index 85bad50..c516dd8 100644
--- a/Tactic.ReduceDec.html
+++ b/Tactic.ReduceDec.html
@@ -1,5 +1,5 @@
 
-Tactic.ReduceDecSource code on Github
{-# OPTIONS --safe --without-K #-}
+Tactic.ReduceDecSource code on Github
{-# OPTIONS --safe --without-K #-}
 --------------------------------------------------------------------------------
 -- reduceDec: looks for proofs of P or ¬P to reduce ⌊ decP ⌋
 --------------------------------------------------------------------------------
@@ -90,65 +90,65 @@
 findDecRWHypWith : ITactic → Term → TC Term
 findDecRWHypWith tac dec =
   helper true $ helper false $
-    error1 "reduceDec: Could not find an equation to rewrite with!"
+    error1 "reduceDec: Could not find an equation to rewrite with!"
   where
     helper : Bool → TC Term → TC Term
-    helper b x = runSpeculativeMaybe (do
-      hole ← newMeta unknown
+    helper b x = runSpeculativeMaybe (do
+      hole ← newMeta unknown
       res ← case b of λ where
-        false → checkType (quote fromWitnessFalse' ∙⟦ dec ∣ hole ⟧) (fromWitness'Type false dec)
-        true  → checkType (quote fromWitness'      ∙⟦ dec ∣ hole ⟧) (fromWitness'Type true  dec)
+        false → checkType (quote fromWitnessFalse' ∙⟦ dec ∣ hole ⟧) (fromWitness'Type false dec)
+        true  → checkType (quote fromWitness'      ∙⟦ dec ∣ hole ⟧) (fromWitness'Type true  dec)
       catch (do
-        runWithHole hole tac
-        debugLogᵐ ("Hypothesis is " ∷ᵈᵐ b ᵛⁿ ∷ᵈᵐ []ᵐ)
+        runWithHole hole tac
+        debugLogᵐ ("Hypothesis is " ∷ᵈᵐ b ᵛⁿ ∷ᵈᵐ []ᵐ)
         return $ just res) (λ _ → return nothing)) x
 
-reduceDecTermWith : ITactic → ReductionOptions → Term → TC (Term × Term)
+reduceDecTermWith : ITactic → ReductionOptions → Term → TC (Term × Term)
 reduceDecTermWith tac r t = inDebugPath "reduceDec" do
-  T ← local (λ env → record env { reduction = r }) (inferType t >>= normalise)
-  debugLog ("Reduce dec in " ∷ᵈ t ∷ᵈ " : " ∷ᵈ T ∷ᵈ [])
+  T ← local (λ env → record env { reduction = r }) (inferType t >>= normalise)
+  debugLog ("Reduce dec in " ∷ᵈ t ∷ᵈ " : " ∷ᵈ T ∷ᵈ [])
   (dec ∷ decs) ← return $ mapMaybe extractDec $ selectSubterms isIsYes T
-    where _ → error1 "No subterms of the form 'isYes t' found!"
+    where _ → error1 "No subterms of the form 'isYes t' found!"
   let scheme = generalizeSubterms isIsYes T
-  debugLog ("Rewrite scheme: " ∷ᵈ scheme ∷ᵈ [])
-  debugLog ("`isYes` to reduce: " ∷ᵈ dec ∷ᵈ [])
+  debugLog ("Rewrite scheme: " ∷ᵈ scheme ∷ᵈ [])
+  debugLog ("`isYes` to reduce: " ∷ᵈ dec ∷ᵈ [])
   eq ← findDecRWHypWith tac dec
-  eqT ← inferType eq
-  debugLog ("Eq: " ∷ᵈ eq ∷ᵈ " : " ∷ᵈ eqT ∷ᵈ [])
+  eqT ← inferType eq
+  debugLog ("Eq: " ∷ᵈ eq ∷ᵈ " : " ∷ᵈ eqT ∷ᵈ [])
   return (scheme , eq)
 
-reduceDecTerm : ReductionOptions → Term → TC (Term × Term)
+reduceDecTerm : ReductionOptions → Term → TC (Term × Term)
 reduceDecTerm r t = do
-  fuel ← getFuel "reduceDec/constrs"
-  reduceDecTermWith (tryConstrsWith' fuel assumption') r t
+  fuel ← getFuel "reduceDec/constrs"
+  reduceDecTermWith (tryConstrsWith' fuel assumption') r t
 
-reduceDec' : ReductionOptions → Term → TC Term
+reduceDec' : ReductionOptions → Term → TC Term
 reduceDec' r t = do
   (scheme , eq) ← reduceDecTerm r t
   return $ quote subst ∙⟦ scheme ∣ eq ∣ t ⟧
 
-reduceDec : ReductionOptions → Term → ITactic
-reduceDec r t = unifyWithGoal =<< reduceDec' r t
+reduceDec : ReductionOptions → Term → ITactic
+reduceDec r t = unifyWithGoal =<< reduceDec' r t
 
-reduceDecInGoal : ReductionOptions → Term → ITactic
+reduceDecInGoal : ReductionOptions → Term → ITactic
 reduceDecInGoal r newGoal = do
-  inj₁ goal ← reader TCEnv.goal
-    where _ → error1 "Goal is not a hole!"
+  inj₁ goal ← reader TCEnv.goal
+    where _ → error1 "Goal is not a hole!"
   (scheme , eq) ← reduceDecTerm r goal
-  unifyWithGoal $ quote subst ∙⟦ scheme ∣ quote sym ∙⟦ eq ⟧ ∣ newGoal ⟧
+  unifyWithGoal $ quote subst ∙⟦ scheme ∣ quote sym ∙⟦ eq ⟧ ∣ newGoal ⟧
 
-module _ ⦃ _ : TCOptions ⦄ where
+module _ ⦃ _ : TCOptions ⦄ where
   macro
     by-reduceDec : Term → Tactic
-    by-reduceDec t = initTac $ reduceDec reduceAll t
+    by-reduceDec t = initTac $ reduceDec reduceAll t
 
     by-reduceDecInGoal : Term → Tactic
-    by-reduceDecInGoal t = initTac $ reduceDecInGoal reduceAll t
+    by-reduceDecInGoal t = initTac $ reduceDecInGoal reduceAll t
 
-    by-reduceDec' : ReductionOptions → Term → Tactic
+    by-reduceDec' : ReductionOptions → Term → Tactic
     by-reduceDec' r t = initTac $ reduceDec r t
 
-    by-reduceDecInGoal' : ReductionOptions → Term → Tactic
+    by-reduceDecInGoal' : ReductionOptions → Term → Tactic
     by-reduceDecInGoal' r t = initTac $ reduceDecInGoal r t
 
 private
@@ -161,7 +161,7 @@
              X Y Z : Set
 
     startDebug : ⊤
-    startDebug = byTC (debugLog1 "\n\n\n\nTesting 'reduceDec'\n")
+    startDebug = byTC (debugLog1 "\n\n\n\nTesting 'reduceDec'\n")
 
     fun : A → A → Bool
     fun a b = ⌊ a ≟ b ⌋
diff --git a/Tactic.Rewrite.html b/Tactic.Rewrite.html
index 44abd7b..d702ffe 100644
--- a/Tactic.Rewrite.html
+++ b/Tactic.Rewrite.html
@@ -1,5 +1,5 @@
 
-Tactic.RewriteSource code on Github
{-# OPTIONS -v rewrite:100 #-}
+Tactic.RewriteSource code on Github
{-# OPTIONS -v rewrite:100 #-}
 module Tactic.Rewrite where
 
 open import Meta.Prelude hiding (_^_)
diff --git a/Tactic.Try.html b/Tactic.Try.html
index ed13431..434a7b6 100644
--- a/Tactic.Try.html
+++ b/Tactic.Try.html
@@ -1,5 +1,5 @@
 
-Tactic.TrySource code on Github
{-# OPTIONS -v try:100 #-}
+Tactic.TrySource code on Github
{-# OPTIONS -v try:100 #-}
 module Tactic.Try where
 
 open import Meta.Prelude
diff --git a/Tactic.html b/Tactic.html
index eaae4ad..db8aa4c 100644
--- a/Tactic.html
+++ b/Tactic.html
@@ -1,5 +1,5 @@
 
-TacticSource code on Github
module Tactic where
+TacticSource code on Github
module Tactic where
 
 open import Tactic.Try public
 open import Tactic.Rewrite public
diff --git a/Text.Format.Generic.html b/Text.Format.Generic.html
index 65a6bee..796b2ab 100644
--- a/Text.Format.Generic.html
+++ b/Text.Format.Generic.html
@@ -1,5 +1,5 @@
 
-Text.Format.GenericSource code on Github
------------------------------------------------------------------------
+Text.Format.GenericSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Format strings for Printf and Scanf
diff --git a/Text.Format.html b/Text.Format.html
index c7450c4..dab6cc4 100644
--- a/Text.Format.html
+++ b/Text.Format.html
@@ -1,5 +1,5 @@
 
-Text.FormatSource code on Github
------------------------------------------------------------------------
+Text.FormatSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Format strings for Printf and Scanf
diff --git a/Text.Printf.Generic.html b/Text.Printf.Generic.html
index e139ab6..9116cde 100644
--- a/Text.Printf.Generic.html
+++ b/Text.Printf.Generic.html
@@ -1,5 +1,5 @@
 
-Text.Printf.GenericSource code on Github
------------------------------------------------------------------------
+Text.Printf.GenericSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Generic printf function.
diff --git a/Text.Printf.html b/Text.Printf.html
index 9d0fe29..dace492 100644
--- a/Text.Printf.html
+++ b/Text.Printf.html
@@ -1,5 +1,5 @@
 
-Text.PrintfSource code on Github
------------------------------------------------------------------------
+Text.PrintfSource code on Github
------------------------------------------------------------------------
 -- The Agda standard library
 --
 -- Printf
diff --git a/index.html b/index.html
index c72c841..4a14dbe 100644
--- a/index.html
+++ b/index.html
@@ -1,5 +1,5 @@
 
-standard-library-metaSource code on Github
module standard-library-meta where
+standard-library-metaSource code on Github
module standard-library-meta where
 
 open import Algebra.Function
 
diff --git a/standard-library-meta.html b/standard-library-meta.html
index 12e3681..190996b 100644
--- a/standard-library-meta.html
+++ b/standard-library-meta.html
@@ -1,5 +1,5 @@
 
-standard-library-metaSource code on Github
module standard-library-meta where
+standard-library-metaSource code on Github
module standard-library-meta where
 
 open import Algebra.Function
 
diff --git a/typecheck.time b/typecheck.time
index c90deb1..1592242 100644
--- a/typecheck.time
+++ b/typecheck.time
@@ -1,40 +1,40 @@
-TOTAL: 3m19s
-Algebra/Function: 0m9s
+TOTAL: 3m20s
+Algebra/Function: 0m10s
 Meta/Prelude: 1m15s
-Class/MonadError: 0m47s
+Class/MonadError: 0m46s
 Class/MonadReader: 0m0s
-Reflection/Syntax: 0m0s
+Reflection/Syntax: 0m1s
 Reflection/Debug: 0m0s
-Class/MonadTC: 0m2s
-Reflection/TCI: 0m0s
+Class/MonadTC: 0m10s
+Reflection/TCI: 0m1s
 Meta/Init: 0m0s
 Reflection/Tactic: 0m0s
 Reflection/Utils: 0m0s
-Reflection/Utils/Debug: 0m1s
-Class/MonadError/Instances: 0m0s
+Reflection/Utils/Debug: 0m0s
+Class/MonadError/Instances: 0m1s
 Class/MonadReader/Instances: 0m0s
 Class/MonadTC/Instances: 0m0s
-Reflection/Utils/TCI: 0m13s
+Reflection/Utils/TCI: 0m3s
 Reflection/Utils/TCM: 0m0s
-Reflection/AlphaEquality: 0m0s
-Reflection/AntiUnification: 0m1s
-Tactic/Try: 0m0s
-Tactic/Rewrite: 0m2s
-Tactic/Extra: 0m0s
+Reflection/AlphaEquality: 0m1s
+Reflection/AntiUnification: 0m0s
+Tactic/Try: 0m1s
+Tactic/Rewrite: 0m1s
+Tactic/Extra: 0m1s
 Tactic/Existentials: 0m0s
-Tactic/ByEq: 0m1s
+Tactic/ByEq: 0m0s
 Tactic/AnyOf: 0m0s
 Tactic/Defaults: 0m0s
 Tactic/Assumption: 0m0s
-Tactic/ClauseBuilder: 0m31s
-Tactic/Case: 0m1s
-Tactic/Constrs: 0m0s
-Tactic/EquationalReasoning: 0m1s
+Tactic/ClauseBuilder: 0m32s
+Tactic/Case: 0m0s
+Tactic/Constrs: 0m1s
+Tactic/EquationalReasoning: 0m0s
 Tactic/Eta: 0m0s
-Tactic/Intro: 0m0s
+Tactic/Intro: 0m1s
 Tactic/ReduceDec: 0m1s
-Tactic/Derive: 0m1s
-Tactic/Derive/TestTypes: 0m1s
+Tactic/Derive: 0m0s
+Tactic/Derive/TestTypes: 0m2s
 Tactic/Derive/DecEq: 0m6s
 Tactic/Derive/Show: 0m3s
 Tactic: 0m0s