diff --git a/lattices/src/ght_lattice.rs b/lattices/src/ght_lattice.rs
index 93e80b8f3360..4469677df9a0 100644
--- a/lattices/src/ght_lattice.rs
+++ b/lattices/src/ght_lattice.rs
@@ -1,3 +1,5 @@
+//! Lattice traits for GHT
+
 use core::cmp::Ordering::{Equal, Greater, Less};
 use std::cmp::Ordering;
 use std::collections::HashMap;
@@ -9,10 +11,6 @@ use variadics::{var_expr, var_type, CloneVariadic, PartialEqVariadic, SplitBySuf
 use crate::ght::{GeneralizedHashTrieNode, GhtGet, GhtInner, GhtLeaf};
 use crate::{IsBot, IsTop, LatticeBimorphism, LatticeOrd, Merge};
 
-//////////////////////////
-/// Lattice traits for GHT
-//////////////////////////
-
 impl<Head, Node> Merge<GhtInner<Head, Node>> for GhtInner<Head, Node>
 where
     Node: GeneralizedHashTrieNode + Merge<Node>,
diff --git a/lattices/src/ght_lazy.rs b/lattices/src/ght_lazy.rs
index f5492b328060..5c4ad122bb9a 100644
--- a/lattices/src/ght_lazy.rs
+++ b/lattices/src/ght_lazy.rs
@@ -16,9 +16,9 @@ use crate::ght::{GeneralizedHashTrieNode, GhtGet, GhtInner, GhtLeaf};
 /// starting with a trie of height 0 and continuing until a trie of height |key| - 1.
 /// Our `force` method does not add a node above a leaf L as in the paper. Instead
 /// it `take`s L from the current trie and merges it into the next trie to the right which is 1 taller.
-
-/// A trait for the behavior we need from the nodes in a COLT forest. Every `ColtForestNode`
-/// is a `GeneralizedHashTrieNode` with some extra methods.
+//
+/// The following trait provides the behavior we need from the nodes in a COLT forest. Every
+/// `ColtForestNode` is a `GeneralizedHashTrieNode` with some extra methods.
 pub trait ColtForestNode: GeneralizedHashTrieNode {
     /// result of `force`ing a node
     type Force: GeneralizedHashTrieNode;