Dynamic Detection of Determinism in Functional Logic Languages

R. Loogen, St. Winkler

	   Programs in functional logic languages usually have to satisfy
	   a {\em nonambiguity condition}, that semantically ensures
	   completeness of conditional narrowing and pragmatically ensures
	   that the defined (non-boolean) functions are deterministic and
	   do not yield different result values for the same argument
	   tuples. The nonambiguity condition allows the dynamic
	   detection of determinism in implementations of functional
	   logic languages. In this paper we show how to achieve this
	   and what can be gained by this optimization.