Solve unguarded recursion with the fixed point algorithm #115
Labels
enhancement
New feature or request
uncommon in practice
An issue that is not typically used, does not occur in our use.
Some of the unguarded recursion (involving monotonous connectives like
allOf
andanyOf
) can be solved with the same algorithm we have for fixed points inFormulaF
, except this time we're looking for least fixed points (?), so we substitutefalse
.The text was updated successfully, but these errors were encountered: