Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(08 Jan 2013 01:33 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Noah Lavine
(11 Jan 2013 02:46 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alaric Snell-Pym
(11 Jan 2013 10:05 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(11 Jan 2013 13:03 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Eli Barzilay
(11 Jan 2013 14:30 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(11 Jan 2013 14:50 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Eli Barzilay
(11 Jan 2013 15:06 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(12 Jan 2013 02:11 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Eli Barzilay
(12 Jan 2013 02:15 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(12 Jan 2013 02:50 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Aaron W. Hsu
(12 Jan 2013 03:38 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(12 Jan 2013 11:33 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Aaron W. Hsu
(15 Jan 2013 19:17 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Eli Barzilay
(16 Jan 2013 07:12 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(16 Jan 2013 08:16 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Eli Barzilay
(16 Jan 2013 08:28 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(16 Jan 2013 14:11 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Eli Barzilay
(16 Jan 2013 14:30 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(16 Jan 2013 14:38 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alaric Snell-Pym
(11 Jan 2013 15:01 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Eli Barzilay
(11 Jan 2013 15:16 UTC)
|
Re: [Scheme-reports] auxiliary syntax John Cowan (11 Jan 2013 15:19 UTC)
|
Re: [Scheme-reports] auxiliary syntax
Alex Shinn
(12 Jan 2013 01:53 UTC)
|
Alaric Snell-Pym scripsit: > This, I think, is really just a matter of degree. As much as the bodies > of let and cond deviate from normal scheme in that they contain lists > whose first member is not a procedure to apply to something, At the end of the day, that only works because the syntax expander has hard-coded knowledge of lambda (and if). It could also have hard-coded knowledge of let, depending on whether the underlying Scheme is willing to see lets or not. > Alex wants to see symbols rather than identifiers. A macro is free to > interpret cons cells, numbers, strings, and so on found in its body as > it sees fit, so why can't it interpret symbols outside of the context > of lexically bound identifiers? It can, if it is not a syntax-rules macro; we all agree on that. Forgive me for being thick, though; why isn't it enough to list these symbols in the exceptions list of syntax-rules? Isn't the whole point of those that they match as if non-hygienic regardless of whether they have been bound to a syntax error (as in R7RS) or not (as in R5RS)? -- John Cowan http://ccil.org/~cowan cowan@ccil.org The work of Henry James has always seemed divisible by a simple dynastic arrangement into three reigns: James I, James II, and the Old Pretender. --Philip Guedalla _______________________________________________ Scheme-reports mailing list Scheme-reports@scheme-reports.org http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports