If one were to think of this as a project, the initial project goal might be
a proof of concept, that such an undertaking though non-trivial may be worth
while.
It would be desirable to act on the abstract syntax trees that result from
the compiler parsing the source code and not the source code itself.
--------------------------------------------------
From: "Vladimir Zlatanov" <[email protected]>
Sent: 10 Thursday December 2009 0745
To: "Haskell Cafe" <[email protected]>
Subject: Re: [Haskell-cafe] Re: Nano-Languages
An important question will be, Will syntax macros work out better than an
existing tool such as Happy?
They work in scheme, and typed scheme
http://www.ccs.neu.edu/scheme/pubs/popl08-thf.pdf
and a different hygienic mscheme is used in dylan
http://people.csail.mit.edu/jrb/Projects/dexprs.pdf
Both are based on pattern matching rewrite rules. Integrating a
similar macro system in haskell should be possible, but definitely not
trivial - how will it interact with the type system?
Haskell is already halfway there, Template Haskell provides a platform
to base them on
http://www.haskell.org/ghc/docs/6.10-latest/html/users_guide/template-haskell.html
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe