compare/primitives.js

@@ -1,4 +1,4 @@
-// Total ordering of primitive types
+import { Char, Double, Int, Unit } from "../primitives/types.js";
 
 export const compareNumbers = x => y => {
   if (typeof(x) !== 'number' || typeof(y) !== 'number') {

compare/structures.js

@@ -1,10 +1,10 @@
-// Total ordering of composed types
-
 import { compareNumbers } from "./primitives.js"
 import { get, length as lengthLs } from "../structures/list.js";
 import { read, length as lengthSet } from "../structures/set.js";
 import { constructorProduct, getLeft, getRight } from "../structures/product.js";
 import { match } from "../structures/sum.js";
+import { makeGeneric } from "../generics/generics.js";
+import { lsType } from "../structures/types.js";
 
 // (a -> a -> Int) -> [a] -> [a] -> Int
 export const compareLists = compareElems => x => y => {
@@ -54,7 +54,7 @@ export const compareSets = compareElems => x => y => {
             // but to be consistent with the other comparison-functions, we don't.
             (keyY => nextY => compareElems(keyX)(keyY) || iterate(nextX)(nextY))
             (0)) // end of set y (we'll never get here because sets are same size)
-          (0); // end of set x
+        (0) // end of set x;
-      return iterate(first(x))(first(y));
+      iterate(first(x))(first(y));
     })();
 };

compare/versioning.js

@@ -1,7 +1,3 @@
-// Total ordering of slots and values (versioning library).
-// Problem: A Value produced by a transformation can depend on other Values of any type!
-//          So, we cannot statically know the entire type -> resort to dynamic typing for these?
-
 export const compareSlots = compareElems => slotA => slotB => {
   if (slotA.depth < slotB.depth) {
     return -1;