ideas for compiler project

[Dylan Thurston]

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

On Thu, Jan 24, 2002 at 03:38:59PM +0100, Bjorn Lisper wrote:
> I think MATLAB's matrix language provides about the right level of
> abstraction for a high-level matrix language. You can for instance write
> things like
>=20
> Y =3D inv(A)*B
>=20
> to assign to Y the solution of Ax =3D B. ...

Just a comment on a long post...  I am personally found of MetaFont's
approach, where you write

 Ax =3D B

to find the solution to Ax =3D B.  When working with transformations and
such, being able to write all your equations "forwards" makes it much
easier to keep everything straight; plus, if you have several equations
for a variable, you don't have to figure out how to gather them
together.  Can anyone see a way to implement something like this in
Haskell?  Or is it better to make a small interpreted language?

Best,
	Dylan Thurston

--Pk6IbRAofICFmK5e
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

iD8DBQE8bzO/Veybfhaa3tcRAiMpAJ9w01Uorm0igerLFijCTUwX+hhAiACfZaXP
VycjFFgMvgQkp4fa685stBU=
=M5mv
-----END PGP SIGNATURE-----

--Pk6IbRAofICFmK5e--