Make Haddock able to parse Idris's source
commitadf51f46b6531ccaeb0c6fa02959ad9e4d1e2595
authorDavid Christiansen <david@davidchristiansen.dk>
dateMon 25 Feb 2013, 11:33 (14 years ago)
parentf8e41c5
src/Core/CaseTree.hs+2−2
@@ -418,8 +418,8 @@ depatt ns tm = dp [] tm
418418 applyMaps ms (App f a) = App (applyMaps ms f) (applyMaps ms a)
419419 applyMaps ms t = t
420420
421−prune :: Bool -> -- ^ Convert single branches to projections (only useful at runtime)
422− SC -> SC
421+prune :: Bool -- ^ Convert single branches to projections (only useful at runtime)
422+ -> SC -> SC
423423prune proj (Case n alts)
424424 = let alts' = filter notErased (map pruneAlt alts) in
425425 case alts' of
src/Core/Elaborate.hs+1−1
@@ -379,7 +379,7 @@ apply :: Raw -> [(Bool, Int)] -> Elab' aux [Name]
379379apply fn imps =
380380 do args <- prepare_apply fn (map fst imps)
381381 fill (raw_apply fn (map Var args))
382− -- *Don't* solve the arguments we're specifying by hand.
382+ -- _Don't_ solve the arguments we're specifying by hand.
383383 -- (remove from unified list before calling end_unify)
384384 -- HMMM: Actually, if we get it wrong, the typechecker will complain!
385385 -- so do nothing