🧩 [consolidate]: Minor tidy up.

src/EvalGraph.purs

@@ -183,16 +183,14 @@ evalWithConfig { g, n, γα } e =
       pure (eα × vα)
 
 graphGC :: forall g. Graph g => GraphConfig g -> Raw Expr -> String + GaloisConnection (Set Vertex) (Set Vertex)
-graphGC { g: g0, n, γα } e =
-   let
-      Identity q = (runWithGraphAllocT (g0 × n) :: _ -> Identity _) $ do
-         eα <- alloc e
-         vα <- eval γα eα S.empty
-         pure (vα × eα)
-   in
-      do
-         (g × _) × vα × eα <- q
-         pure $
-            { fwd: \αs -> G.vertices (fwdSlice αs g) `intersection` vertices vα
-            , bwd: \αs -> G.vertices (bwdSlice αs g) `intersection` vertices eα -- needs to include γα
-            }
+graphGC { g: g0, n, γα } e = do
+   (g × _) × vα × eα <- q
+   pure $
+      { fwd: \αs -> G.vertices (fwdSlice αs g) `intersection` vertices vα
+      , bwd: \αs -> G.vertices (bwdSlice αs g) `intersection` vertices eα -- needs to include γα
+      }
+   where
+   Identity q = (runWithGraphAllocT (g0 × n) :: _ -> Identity _) $ do
+      eα <- alloc e
+      vα <- eval γα eα S.empty
+      pure (vα × eα)

src/GaloisConnection.purs

@@ -12,7 +12,7 @@ type GaloisConnection a b =
    }
 
 deMorgan :: forall a b. BooleanLattice a => BooleanLattice b => Endo (a -> b)
-deMorgan f = neg >>> f >>> neg
+deMorgan = (neg >>> _) >>> (_ >>> neg)
 
 -- Could unify deMorgan and dual but would need to reify notion of opposite category.
 dual :: forall a b. BooleanLattice a => BooleanLattice b => GaloisConnection a b -> GaloisConnection b a

test/Util.purs

@@ -106,7 +106,7 @@ testGraph s gconf { δv, bwd_expect, fwd_expect } = do
    -- | Eval
    e <- desug s
    tEval1 <- preciseTime
-   (g × _) × (eα × vα) <- evalWithConfig gconf e >>= except
+   (g × _) × eα × vα <- evalWithConfig gconf e >>= except
    tEval2 <- preciseTime
 
    -- | Backward