@@ -359,18 +359,18 @@ elabEliminator paramPos n ty cons info = do
359 freshName key = do
359 freshName key = do
360 nameMap <- get
360 nameMap <- get
361 let i = fromMaybe 0 (Map.lookup key nameMap)
361 let i = fromMaybe 0 (Map.lookup key nameMap)
362− let name = key ++ show i ++ "__"
362+ let name = key ++ show i
363 put $ Map.insert key (i+1) nameMap
363 put $ Map.insert key (i+1) nameMap
364− return (MN i name)
364+ return (UN name)
366 scrutineeName :: Name
366 scrutineeName :: Name
367− scrutineeName = MN 0 "scrutinee"
367+ scrutineeName = UN "scrutinee"
369 scrutineeArgName :: Name
369 scrutineeArgName :: Name
370− scrutineeArgName = MN 0 "scrutineeArg"
370+ scrutineeArgName = UN "scrutineeArg"
372 motiveName :: Name
372 motiveName :: Name
373− motiveName = MN 0 "prop"
373+ motiveName = UN "prop"
375 mkMotive :: Name -> [Int] -> [(Name, Plicity, PTerm)] -> [(Name, Plicity, PTerm)] -> PTerm
375 mkMotive :: Name -> [Int] -> [(Name, Plicity, PTerm)] -> [(Name, Plicity, PTerm)] -> PTerm
376 mkMotive n paramPos params indicies =
376 mkMotive n paramPos params indicies =
@@ -460,7 +460,7 @@ elabEliminator paramPos n ty cons info = do
460 let (_, consIdxs) = splitArgPms resTy
460 let (_, consIdxs) = splitArgPms resTy
461 return $ piConstr (implidxs ++ consArgs ++ recMotives) (applyMotive consIdxs (applyCons cnm consArgs))
461 return $ piConstr (implidxs ++ consArgs ++ recMotives) (applyMotive consIdxs (applyCons cnm consArgs))
462 where applyRecMotive :: (Name, Plicity, PTerm) -> (Name, Plicity, PTerm)
462 where applyRecMotive :: (Name, Plicity, PTerm) -> (Name, Plicity, PTerm)
463− applyRecMotive (n,_,ty) = (MN 0 $ "ih" ++ simpleName n, expl, applyMotive idxs (PRef elimFC n))
463+ applyRecMotive (n,_,ty) = (UN $ "ih" ++ simpleName n, expl, applyMotive idxs (PRef elimFC n))
464 where (_, idxs) = splitArgPms ty
464 where (_, idxs) = splitArgPms ty
466 findRecArgs :: [(Name, Plicity, PTerm)] -> [(Name, Plicity, PTerm)]
466 findRecArgs :: [(Name, Plicity, PTerm)] -> [(Name, Plicity, PTerm)]