Fix documentation and remove obsolete TODO

crates/metaslang/bindings/src/lib.rs

@@ -169,8 +169,6 @@ impl<KT: KindTypes + 'static> Bindings<KT> {
                     } else {
                         // TODO: what should we do if the parent reference
                         // cannot be resolved at this point?
-                        // TODO: also, since jump_to_definition() may
-                        // recursively use this method, we need to handle cycles
                         self.to_reference(*handle).unwrap().jump_to_definition()
                     }
                 })

crates/metaslang/bindings/src/resolver/c3.rs

@@ -3,9 +3,11 @@ use std::fmt::{Debug, Display};
 use std::hash::Hash;
 
 /// Produces a linearisation of a hierarchy of items using the C3 linearisation
-/// algorithm. Given an item A with parents (B1, B2) in that order, the
+/// algorithm. Given an item `A` with parents `(B1, B2)` in that order, the
 /// linearisation of A can be defined as:
+/// ```
 /// L(A) = [A] + merge(L(B1), L(B2), [B1, B2])
+/// ```
 /// The merge operation (defined below) will order the items of the vectors by
 /// taking candidates that can only appear in the first position in all of the
 /// vectors.