[clean-list] Undefined value and theorem proving
Dmitry Malenko
maldim@gmx.net
Wed, 05 Feb 2003 09:48:12 +0200
Hi, All!
In an example given in "Theorem Proving for Functional Programmers -
SPARKLE: A Functional Theorem Prover" restriction is put that
take :: Int ![a] -> [a]
does not get an undefined value as its first argument.
So I wonder how it is possible to call take with undefined value? And in
general, what operations in Clean can result with undefined expression?
--
Best regards, Dmitry Malenko.
+----------------------------------------------------+
Registered Linux user #258004
ALT Linux Team http://www.altlinux.ru
+----------------------------------------------------+
Do you guys know what you're doing, or are you just hacking?