Re: are dylan macros Turing-complete?

[Colin Walters <address@hidden>]

Bruce Hoult <bruce@hoult.org> writes:

> Really?
> 
> What does the "setf" macro expand to in your favourite Lisp compiler?

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.
This is an important conceptual difference between the two, I think.
I note in my paper that despite this, the Dylan macro system appears
to be able to express the majority of transformations that defmacro
can.

I'm not talking about the Dylan := macro or CL's `setf' specifically.