I actually agree. If you want for instance some weird scoping rule like
; example taken from PG's On Lisp
; "it" refers to the big-long-expression
; "aif" stands for "anamorphic if"
(aif big-long-expression
(foo it)
(bar it))
then combinator libraries won't cut it. Template Haskell might, however (but its' not standard, and besides our point).
Now my point is that the subset we speak of is easier to achieve through functions with lazy evaluation. Macros are more capable, but harder to deal with. This is magnified by Haskell's paranoid type system: functions are checked in ways macros aren't.
So my guess is that neither system dominates the other.
Now my point is that the subset we speak of is easier to achieve through functions with lazy evaluation. Macros are more capable, but harder to deal with. This is magnified by Haskell's paranoid type system: functions are checked in ways macros aren't.
So my guess is that neither system dominates the other.