-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
> It's annoying to type the bars for 0-vector in emails :) > But yes, 0-vector. I'm a bit unsure if the runtime supports residual > vectors though. That's why I used the array notation in the first place ;) > I'm not really sure what the question is. Basically, you loop until you > find a matching pattern, execute the code, if it fails, try the next > patterns. Well, the function looks like: case e equation <some equations> then ... case e equation <some different equations> then ... since e is the same in both case expressions, classical pattern matching would return always the same (or fail with an error). So my guess is, that the equations affect the matching process (like guards) is that correct? Is there some documentation about that somewhere (I remember something from adrian in Erlangen)? - -- Christoph Höger Technische Universität Berlin Fakultät IV - Elektrotechnik und Informatik Übersetzerbau und Programmiersprachen Sekr. TEL12-2, Ernst-Reuter-Platz 7, 10587 Berlin Tel.: +49 (30) 314-24890 E-Mail: [email protected] -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.11 (GNU/Linux) Comment: Using GnuPG with Fedora - http://enigmail.mozdev.org/ iEYEARECAAYFAk02zhoACgkQhMBO4cVSGS/sMACgtgtVk1aSH+zEk8AJ3HYSw+OY pVoAoIP4+nR8KOloqizySKFKhhtk1JSm =nnfZ -----END PGP SIGNATURE-----
