joshua/nominal-lstar
1
Fork 0
mirror of https://github.com/Jaxan/nominal-lstar.git synced 2025-04-27 14:47:45 +02:00
Code Issues Releases Activity

Fixes a bug in my Bollig implementation

Browse source
This commit is contained in:
Joshua Moerman 2016-06-23 17:16:02 +02:00
parent 9ac25c4d9b
commit e65a099948
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/Bollig.hs
View file

@ -60,7 +60,7 @@ rfsaConsistencyTest State{..} = case solve (isEmpty defect) of
Nothing -> trace "@@@ Unsolved Formula (rfsaConsistencyTest) @@@" $ Nothing -> trace "@@@ Unsolved Formula (rfsaConsistencyTest) @@@" $
Failed empty defect Failed empty defect
where where
candidates = pairsWithFilter (\u1 u2 -> maybeIf (row t u1 `sublang` row t u2) (u1, u2)) ss ss candidates = pairsWithFilter (\u1 u2 -> maybeIf (row t u2 `sublang` row t u1) (u1, u2)) ss ss
defect = triplesWithFilter (\(u1, u2) a v -> maybeIf (not (tableAt t (u1 ++ [a]) v) /\ tableAt t (u2++[a]) v) (a:v)) candidates aa ee defect = triplesWithFilter (\(u1, u2) a v -> maybeIf (not (tableAt t (u1 ++ [a]) v) /\ tableAt t (u2++[a]) v) (a:v)) candidates aa ee
constructHypothesisBollig :: NominalType i => State i -> Automaton (BRow i) i constructHypothesisBollig :: NominalType i => State i -> Automaton (BRow i) i