rename inferTop' to more descriptive inferTop1

src/Disco/Interactive/Commands.hs

@@ -310,7 +310,7 @@ handleAnn ::
   REPLExpr 'CAnn ->
   Sem r ()
 handleAnn (Ann t) = do
-  (at, _) <- typecheckTop $ inferTop' t
+  (at, _) <- typecheckTop $ inferTop1 t
   infoPretty at
 
 ------------------------------------------------------------
@@ -333,7 +333,7 @@ handleCompile ::
   REPLExpr 'CCompile ->
   Sem r ()
 handleCompile (Compile t) = do
-  (at, _) <- typecheckTop $ inferTop' t
+  (at, _) <- typecheckTop $ inferTop1 t
   infoPretty . compileTerm $ at
 
 ------------------------------------------------------------
@@ -356,7 +356,7 @@ handleDesugar ::
   REPLExpr 'CDesugar ->
   Sem r ()
 handleDesugar (Desugar t) = do
-  (at, _) <- typecheckTop $ inferTop' t
+  (at, _) <- typecheckTop $ inferTop1 t
   info $ pretty' . eraseDTerm . runDesugar . desugarTerm $ at
 
 ------------------------------------------------------------
@@ -805,7 +805,7 @@ tableCmd =
 
 handleTable :: Members (Error DiscoError ': State TopInfo ': Output (Message ()) ': EvalEffects) r => REPLExpr 'CTable -> Sem r ()
 handleTable (Table t) = do
-  (at, ty) <- inputToState . typecheckTop $ inferTop' t
+  (at, ty) <- inputToState . typecheckTop $ inferTop1 t
   v <- mapError EvalErr . evalTerm False $ at
 
   tydefs <- use @TopInfo (replModInfo . to allTydefs)

src/Disco/Typecheck.hs

@@ -144,7 +144,7 @@ checkModule name imports (Module es _ m docs terms) = do
         (x : _) -> throw $ noLoc $ DuplicateDefns (coerce x)
         [] -> do
           aprops <- mapError noLoc $ checkProperties docCtx -- XXX location?
-          aterms <- mapError noLoc $ mapM inferTop' terms -- XXX location?
+          aterms <- mapError noLoc $ mapM inferTop1 terms -- XXX location?
           return $ ModuleInfo name imports (map ((name .-) . getDeclName) typeDecls) docCtx aprops tyCtx tyDefnCtx defnCtx aterms es
  where
   getDefnName :: Defn -> Name ATerm
@@ -456,11 +456,11 @@ infer = typecheck Infer
 
 -- | Top-level type inference algorithm, returning only the first
 --   possible result.
-inferTop' ::
+inferTop1 ::
   Members '[Output (Message ann), Reader TyCtx, Reader TyDefCtx, Error TCError, Fresh] r =>
   Term ->
   Sem r (ATerm, PolyType)
-inferTop' t = NE.head <$> inferTop 1 t
+inferTop1 t = NE.head <$> inferTop 1 t
 
 -- | Top-level type inference algorithm: infer up to the requested max
 --   number of possible (polymorphic) types for a term by running type