A Definite and Unfoldable, Partially Deterministic Language
W. Ken Jackson · The Computer Journal · 1994
We define a simple non-deterministic functional language that has definite variables and where function application is unfoldable. This language demonstrates the Søndergaard and Sestoft's claim, that in a non-deterministic language we cannot obtain both definiteness and unfoldability, assumes a fairly general notion of non-determinism. Our language relies on using a restricted notion of non-determinism called partial determinism.