Top.Implementation.TypeGraph.DefaultHeuristics

Documentation

defaultHeuristics :: Show info => Path (EdgeId, info) -> [Heuristic info]

inMininalSet :: Path (EdgeId, info) -> Heuristic info

Compute the smallest minimal sets. This computation is very(!) costly (might take a long time for complex inconsistencies)

highParticipation :: Show info => Double -> Path (EdgeId, info) -> Heuristic info

Although not as precise as the minimal set analysis, this calculates the participation of each edge in all error paths. Default ratio = 1.0 (100 percent) (the ratio determines which scores compared to the best are accepted)

firstComeFirstBlamed :: Heuristic info

Select the latest constraint

selectConstraintNumbers :: [EdgeNr] -> Heuristic info

Select only specific constraint numbers

inPredicatePath :: Heuristic info

Select only the constraints for which there is evidence in the predicates of the current state that the constraint at hand is incorrect.