Fixing non-determinism
Alexander Vandenbroucke, Tom Schrijvers, Frank Piessens · 2015
Non-deterministic computations are conventionally modelled by lists of their outcomes. This approach provides a concise declarative description of certain problems, as well as a way of generically solving such problems.