       newSet()
   _name = ({name}) -> name
   toDependent = (name, deps) -> {name, deps: map ((name) -> {name}), setToArray deps}
-  constrained = freshInstance (new Context), type
+  constrained = freshInstance fakeContext(), type
   allVars = findFree constrained
   constrainingVars = concatMaps (notConstrained c.types for c in constrained.constraints)...
   constrainingGroups = topologicallySortedGroups mapToArrayVia toDependent, constrainingVars

  else
    printer type

forallToHumanReadable = (type) ->
  notConstrained = (type) ->
    if type.Types and type.types.length > 1

    isTyped = (completion) ->
      completion.score isnt UNTYPED_PENALTY

    scored = (mapMap scoreAndPrint, validDefinitions)
    partitionMap isTyped, filterMap originalOrTyped, scored)
  values concatMaps typed..., untyped...
  # allDefs = concatMaps typed, notTyped # TODO: don't use object key ordering for ordering
  # values mapMap (__ plainPrettyPrint, _type), allDefs
