From: David Picon Alvarez (email@example.com)
Date: Sat Sep 10 2005 - 18:40:21 MDT
> This is a hard project but not an infeasible one.
Good to know.
> The approach I would take would be to try to make a nice FPGA
> of term graph rewriting, a key operation underlying functional languages
> (e.g. efficient graph rewriting enables efficient functional program
Back to heavy maths reading, I see :-)
> Some pointers to the graph rewriting literature are:
> As well as Haskell, the language CLEAN is worth looking at in this
I'll do so, as I've never heard of it.
If something comes of this I'll let you know.
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:52 MDT