v0.86.1 - Remove all the non-ascii characters

arendsee · arendsee · commit afa1a2a0a342 · 2026-05-23T18:43:58.000-04:00
diff --git a/library/Morloc/CodeGenerator/Express.hs b/library/Morloc/CodeGenerator/Express.hs
@@ -447,7 +447,7 @@ expressPolyExpr
 -- target language (e.g. `x.field` for .isFile). Wrapping in
 -- PolyManifold creates a nested manifold whose body's `return` leaks
 -- into the parent's scope when the manifold gets inlined by codegen.
--- Treating PatCallP like srcInline matches its semantics — it's
+-- Treating PatCallP like srcInline matches its semantics - it's
 -- always a leaf expression, never a real function call.
 expressPolyExpr
   findRemote
diff --git a/library/Morloc/CodeGenerator/Grammars/Translator/Imperative.hs b/library/Morloc/CodeGenerator/Grammars/Translator/Imperative.hs
@@ -298,7 +298,7 @@ data LowerConfig m = LowerConfig
   -- ^ name, all args, manifold type, priorLines, body, headForm
   -- Returns Nothing if dedup'd (C++), Just funcDef otherwise
   , lcMakeLambda :: MDoc -> [MDoc] -> [MDoc] -> MDoc
-  -- ^ name, contextArgs, boundArgs → partial application expression
+  -- ^ name, contextArgs, boundArgs - partial application expression
   , lcRegisterSchema :: Text -> m Int
   -- ^ Register a schema string and return its unique ID (index into schema table)
   }
diff --git a/library/Morloc/CodeGenerator/Serial.hs b/library/Morloc/CodeGenerator/Serial.hs
@@ -320,7 +320,7 @@ makeSerialAST m lang t0 = do
     makeSerialAST' gscope typepackers ft@(VarF v@(FV gv cv)) = do
       anc <- MM.gets stateSerialAncestors
       -- Cycle detection: a bare reference to a record currently being
-      -- lowered is a guarded self-recursive back-edge (see §3 in the
+      -- lowered is a guarded self-recursive back-edge (see seciont 3 in the
       -- recursive-fields plan -- TypeEval leaves these as VarU/VarF).
       -- Emit SerialRec instead of trying to look up a packer.
       if Set.member gv anc
diff --git a/library/Morloc/CodeGenerator/SystemConfig.hs b/library/Morloc/CodeGenerator/SystemConfig.hs
@@ -98,7 +98,7 @@ configureAllSteps verbose force slurmSupport sanitize config = do
   -- Strategy (in priority order):
   --   1. MORLOC_RUST_BIN: directory with pre-built libmorloc.so + morloc-nexus
   --      (used for release installs with portable musl-linked binaries)
-  --   2. MORLOC_RUST_DIR: Cargo workspace source — build from source via cargo
+  --   2. MORLOC_RUST_DIR: Cargo workspace source - build from source via cargo
   --      (used for development and container builds)
   --   3. Auto-detect Cargo workspace relative to morloc binary
   let soPath = libDir </> "libmorloc.so"
diff --git a/library/Morloc/Frontend/Parser.y b/library/Morloc/Frontend/Parser.y
@@ -814,7 +814,7 @@ types1 :: { [TypeU] }
   | types1 atom_type           { $1 ++ [$2] }
 
 -- An effect row: comma-separated UPPER labels plus at most one LOWER
--- tail variable (validated by 'mkEffectRow'). `<…>` is effects-only;
+-- tail variable (validated by 'mkEffectRow'). `<...>` is effects-only;
 -- the bare `<a>` existential-hole syntax was removed.
 effect_row :: { [Either EffectLabel TVar] }
   : effect_item                     { [$1] }
diff --git a/library/Morloc/Frontend/Restructure.hs b/library/Morloc/Frontend/Restructure.hs
@@ -894,9 +894,9 @@ refineKinds dag = do
     --
     -- Implicit constraints come from canonical operator forms:
     --
-    -- - @RecExtendU k _ (RecVarU r)@ — extending a polymorphic Rec by
+    -- - @RecExtendU k _ (RecVarU r)@ - extending a polymorphic Rec by
     --   a literal key emits @CDisjoint (SetLitU [StrLitU k]) (KeysU r)@.
-    -- - @RecRestrictU r l@ — restricting a Rec to a list of keys emits
+    -- - @RecRestrictU r l@ - restricting a Rec to a list of keys emits
     --   @CSubset (ListToSetU l) (KeysU r)@.
     --
     -- Constraints are de-duplicated against the existing @econs@ set so
diff --git a/library/Morloc/Frontend/Typecheck.hs b/library/Morloc/Frontend/Typecheck.hs
@@ -2052,7 +2052,7 @@ tryExtractStrListPre g (AnnoS _ _ e) = tryEvalStrList g e
 -- When a function has labeled nat params (e.g., m:Int -> Tensor1 m Real)
 -- and the corresponding arguments are int literals or let-bound ints,
 -- inject NatVarU solutions into gamma so the return type gets concrete
--- dimensions. Same for Str labels (e.g., f:Str -> Tagged f a) — extract
+-- dimensions. Same for Str labels (e.g., f:Str -> Tagged f a) - extract
 -- string literals from the corresponding args and inject StrVarU solutions
 -- into gammaStrSubs. See plans/tables/05-labels-as-type-vars.md.
 resolveNatLabels ::
diff --git a/library/Morloc/Namespace/Prim.hs b/library/Morloc/Namespace/Prim.hs
@@ -86,15 +86,15 @@ import Text.Read (readMaybe)
 
 -- | Kind of a type variable.
 --
--- - 'KindType' — proper type variable (the default)
--- - 'KindNat' — natural number (for dimensions, e.g. Vector n a)
--- - 'KindStr' — string literal at the type level (for column names, e.g. f:Str
+-- - 'KindType' - proper type variable (the default)
+-- - 'KindNat' - natural number (for dimensions, e.g. Vector n a)
+-- - 'KindStr' - string literal at the type level (for column names, e.g. f:Str
 --               in the Stage 2 tables refactor). See plans/tables/04-str-solver-scope.md.
--- - 'KindRec' — row-polymorphic record schema (for column maps, e.g. r:Rec in
+-- - 'KindRec' - row-polymorphic record schema (for column maps, e.g. r:Rec in
 --               Table n r). See plans/tables/10-rec-solver-decidability.md.
--- - 'KindList' — ordered, position-preserving sequence parameterised by an
+-- - 'KindList' - ordered, position-preserving sequence parameterised by an
 --               element kind (e.g. List Str for column-name lists).
--- - 'KindSet' — unordered, duplicate-free collection parameterised by an
+-- - 'KindSet' - unordered, duplicate-free collection parameterised by an
 --               element kind (e.g. Set Str for the keys of a Rec).
 data Kind
   = KindType
diff --git a/library/Morloc/Namespace/State.hs b/library/Morloc/Namespace/State.hs
@@ -281,7 +281,7 @@ data Gamma = Gamma
   -- of the tables refactor; see plans/tables/10-rec-solver-decidability.md).
   , gammaRecSubs :: Map TVar TypeU
   -- | Solutions for ListVarU variables from list constraint solving (Stage 8
-  -- of the tables refactor — foundational kind layer).
+  -- of the tables refactor - foundational kind layer).
   , gammaListSubs :: Map TVar TypeU
   -- | Solutions for SetVarU variables from set constraint solving (Stage 8).
   , gammaSetSubs :: Map TVar TypeU
@@ -305,7 +305,7 @@ data Gamma = Gamma
   -- @Nothing@ means "no signature has been claimed yet"; the next
   -- @VarS (MonomorphicExpr (Just _) _)@ handled by 'synthE' will lock
   -- in its declared @econs@ as the assumption set. @Just@ (even @Just
-  -- []@) means the slot is taken — subsequent inner VarS calls add
+  -- []@) means the slot is taken - subsequent inner VarS calls add
   -- only to @gammaConstraints@, never to assumptions. The Maybe
   -- distinguishes "outermost-not-seen-yet" from "outermost-seen-with-
   -- empty-econs", which a plain list cannot.
diff --git a/library/Morloc/Namespace/Type.hs b/library/Morloc/Namespace/Type.hs
@@ -1187,7 +1187,7 @@ containsUnk StrVoidT = False
 
 ----- Pretty instances -------------------------------------------------------
 
--- | Records, objects, and tables render identically in type signatures —
+-- | Records, objects, and tables render identically in type signatures -
 -- just the type name optionally followed by parameters. The record/object/
 -- table distinction is surfaced separately in the CLI help's type
 -- definition block, where each named type is listed with its tag and
diff --git a/library/Morloc/ProgramBuilder/Install.hs b/library/Morloc/ProgramBuilder/Install.hs
@@ -203,9 +203,9 @@ matchIgnorePattern pat relPath
            || (dir ++ "/") `isPrefixOf` relPath
            || ("/" ++ dir ++ "/") `isInfixOf` ("/" ++ relPath)
            || takeFileName (takeDirectory relPath) == dir
-  -- Pattern contains / → match against full relative path
+  -- Pattern contains / -> match against full relative path
   | '/' `elem` pat = matchGlob pat relPath
-  -- Pattern without / → match against filename only
+  -- Pattern without / -> match against filename only
   | otherwise = matchGlob pat (takeFileName relPath)
 
 -- ======================================================================
diff --git a/library/Morloc/Typecheck/Internal.hs b/library/Morloc/Typecheck/Internal.hs
@@ -239,7 +239,7 @@ reduceRecUnion a b = case (collectGroundRec a, collectGroundRec b) of
 --   informative as the input.
 -- - @Left msg@: contradicts; constraint cannot be satisfied.
 --
--- Typeclass constraints ('Constraint cls ts') aren't handled here —
+-- Typeclass constraints ('Constraint cls ts') aren't handled here -
 -- they pass through unchanged and are left for the typeclass-discharge
 -- machinery elsewhere.
 reduceConstraint :: Constraint -> Either Text (Maybe Constraint)
@@ -322,7 +322,7 @@ normaliseSet t = t
 --      (fully decided as true): drop it.
 --   2. Returns 'Left msg' (contradiction): the whole pass fails with
 --      the first contradiction.
---   3. Returns 'Right (Just c')' (still deferred — typically because a
+--   3. Returns 'Right (Just c')' (still deferred - typically because a
 --      row variable, list variable, etc., is not yet ground): the
 --      constraint is checked against @gammaAssumedConstraints@. If
 --      @c'@ is identical (after applying gamma) to one of the
@@ -339,18 +339,18 @@ normaliseSet t = t
 -- the body's gamma has solved everything that *can* be solved at this
 -- function's level, a leftover obligation is one of two things:
 --
---   * Equivalent (after apply) to a declared assumption — meaning the
+--   * Equivalent (after apply) to a declared assumption - meaning the
 --     caller has already promised this. We discharge it: the obligation
 --     is the caller's promise.
---   * Not equivalent to anything — meaning the body needs more than the
+--   * Not equivalent to anything - meaning the body needs more than the
 --     signature declares. That is a real error: the user must add the
 --     missing constraint to the function's @=>@ clause (or change the
 --     body so the constraint is no longer needed).
 --
 -- This is essentially the same shape as Haskell's "missing class
 -- constraint" diagnostic, restricted to morloc's primitive Member /
 -- Subset / Disjoint forms. Equivalence is structural after gamma
--- application — two constraints are subsumed when their applied forms
+-- application - two constraints are subsumed when their applied forms
 -- are exactly @==@. We do not attempt logical implication (e.g.,
 -- @CSubset a b /\ CSubset b c => CSubset a c@); subsumption is the
 -- conservative-but-decidable approximation.
@@ -896,7 +896,7 @@ applyNatSolutions subs g0 = foldM applySub g0 (Map.toList subs)
       in case solveExist v t g of
            Right (Just g') -> Right g'
            Right Nothing ->
-             -- Not an existential — store as a NatVarU solution
+             -- Not an existential - store as a NatVarU solution
              Right g { gammaNatSubs = Map.insert v t (gammaNatSubs g) }
            Left err -> Left err
 
diff --git a/library/Morloc/Typecheck/ListSolver.hs b/library/Morloc/Typecheck/ListSolver.hs
@@ -8,7 +8,7 @@ License     : Apache-2.0
 Maintainer  : z@morloc.io
 
 Solves equality and basic constraint problems on List-kinded type
-expressions (Stage 8 of the tables refactor — foundational kind layer).
+expressions (Stage 8 of the tables refactor - foundational kind layer).
 
 The canonical form is a flat sequence of "chunks" where each chunk is
 either a ground literal element ('Lit') or a list-tail variable ('Var').
@@ -25,7 +25,7 @@ Decidability:
 
 Element-level equality (e.g. between two 'StrLitU' values) is checked by
 this solver structurally; per-element type unification is the calling
-typechecker's responsibility — this solver only checks structural
+typechecker's responsibility - this solver only checks structural
 equality of the chunk sequence.
 -}
 module Morloc.Typecheck.ListSolver
diff --git a/library/Morloc/Typecheck/RecSolver.hs b/library/Morloc/Typecheck/RecSolver.hs
@@ -26,7 +26,7 @@ Decidability follows the rules in plans/tables/10-rec-solver-decidability.md:
 - Intersection (@&@) defers when either side has a row-var tail.
 
 Type-level field types are 'TypeU' values. Per-field type unification is the
-responsibility of the calling typechecker — this solver only checks structural
+responsibility of the calling typechecker - this solver only checks structural
 equality of the field set.
 -}
 module Morloc.Typecheck.RecSolver
diff --git a/library/Morloc/Typecheck/SetSolver.hs b/library/Morloc/Typecheck/SetSolver.hs
@@ -8,7 +8,7 @@ License     : Apache-2.0
 Maintainer  : z@morloc.io
 
 Solves equality and basic constraint problems on Set-kinded type
-expressions (Stage 8 of the tables refactor — foundational kind layer).
+expressions (Stage 8 of the tables refactor - foundational kind layer).
 
 The canonical form is a sorted, dedup'd list of element 'TypeU' values
 plus an optional set-tail variable. Two sets are equal when their

Original file line number	Diff line number	Diff line change
`@@ -298,7 +298,7 @@ data LowerConfig m = LowerConfig`
`298`	`298`	`-- ^ name, all args, manifold type, priorLines, body, headForm`
`299`	`299`	`-- Returns Nothing if dedup'd (C++), Just funcDef otherwise`
`300`	`300`	`, lcMakeLambda :: MDoc -> [MDoc] -> [MDoc] -> MDoc`
`301`		`- -- ^ name, contextArgs, boundArgs → partial application expression`
	`301`	`+ -- ^ name, contextArgs, boundArgs - partial application expression`
`302`	`302`	`, lcRegisterSchema :: Text -> m Int`
`303`	`303`	`-- ^ Register a schema string and return its unique ID (index into schema table)`
`304`	`304`	`}`