Re: are dylan macros Turing-complete?

[Sean Case <address@hidden>]

In article <elgl87kf60.church.of.emacs@localhost.verbum.private>,
 Colin Walters <walters@verbum.org> wrote:

> Sorry.  I meant that Lisp's `defmacro' can perform arbitrary
> computation in Lisp to compute a macro expansion, while the Dylan
> macro system appears to be restricted to recursive pattern matching.

The Dylan macro system seems to owe a lot to Scheme hygienic macros,
which wouldn't be terribly surprising.

Sean Case

-- 
Sean Case                       gsc@zip.com.au

Code is an illusion.  Only assertions are real.