29 Oct
2008
29 Oct
'08
2:48 p.m.
On Wed, Oct 29, 2008 at 07:02:46AM -0700, Andrew Sackville-West wrote:
On Wed, Oct 29, 2008 at 09:27:32AM +0100, Tillmann Rendel wrote:
...
Since Haskell features algebraic data types, and a reasonable flexible syntax, you do not need to do any parsing. Instead, you can write down the AST of the embedded language directly as part of your Haskell program. But you have to write an evaluator. With pattern matching, that is often very easy, though.
looks like I'm off to read about Template Haskell.
And it looks like: http://www.haskell.org/tmrwiki/TemplateHaskell#head-96ad34fffdb541d4e334edee... is a pretty good starting point. To write a symbolic differentiator in haskell, with evaluable results, this looks to be the way to start. A