Z_n in Haskell

[Ken Shan]

--SkvwRMAIpAhPCcCJ
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable

On 2002-03-28T13:27:42-0800, Hal Daume III wrote:
> Suppose I want to define integers modulo n, I could do this something

Check out the message "Modular arithmetic" earlier on haskell-cafe
(http://www.haskell.org/pipermail/haskell-cafe/2001-August/002132.html)
and its followup...

--=20
Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig
Dyer Honeycutt
3192 Anchor Drive
Southside, AL 35907-0866

--SkvwRMAIpAhPCcCJ
Content-Type: application/pgp-signature
Content-Disposition: inline

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iD8DBQE8o46ezjAc4f+uuBURAvKwAJ9Dv6zigbDbu9B3eOoTwoi7msW9MACgj+l2
POwnhFy8vC7jJuXpLFQ+MU0=
=9+XM
-----END PGP SIGNATURE-----

--SkvwRMAIpAhPCcCJ--