<div dir="ltr"><br><div class="gmail_extra"><br><br><div class="gmail_quote">On Thu, Apr 4, 2013 at 5:32 PM, Lindsey Kuper <span dir="ltr"><<a href="mailto:lkuper@cs.indiana.edu" target="_blank">lkuper@cs.indiana.edu</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">On Thu, Apr 4, 2013 at 11:15 AM, Matthias Felleisen<br>
<<a href="mailto:matthias@ccs.neu.edu">matthias@ccs.neu.edu</a>> wrote:<br>
><br>
> Lindsey, in your case, I believe the 'rabbit hole' can be avoided.<br>
><br>
> From what I understand each family in lambdaLVar is (almost) uniformly<br>
> generated from a grammar 'functor' that receives a lattice (let's say<br>
> one for now), computes some grammatical clauses -- and may add some<br>
> primitive operations for working on the lattice, which is trivial --<br>
> and returns that grammar.<br>
<br>
</div>Yes, that sounds very much like what I want to do. Will this sort of<br>
thing be possible in a future-Redex-with-modules?<br>
<div class="im"><br></div></blockquote><div><br></div><div style>Yes.</div><div style><br></div><div style>One thing to watch out for, tho, is that redex uses source location information to typeset grammars and when macros are involved, the source locations (naturally) get mixed up. Since a macro can do arbitrary computation at runtime, however, you can fiddle with the source locations in the output of your macro to overcome this problem (but it isn't the easiest thing in the world).</div>
<div style><br></div><div style>Robby</div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">
> The reduction relation itself does not depend on the generated grammar<br>
> other than the notion of value you need for beta-v.<br>
><br>
> So, I think that you could use _Racket_'s syntax system to compute<br>
> the grammar. This is quite different from extending a base grammar<br>
> with new features or value clauses but as I said at the beginning,<br>
> it is closer to the way you describe lambdaLVar.<br>
<br>
</div>So, in other words, have a macro that generates a Redex grammar? I<br>
can give that a try. I did think that might be what I would end up<br>
doing, but wanted to see first if I could get the results I wanted<br>
without leaving Redex (and extending a base grammar was a kind of<br>
hacky attempt to stay within Redex).<br>
<br>
Thanks,<br>
<div class="HOEnZb"><div class="h5">Lindsey<br>
____________________<br>
Racket Users list:<br>
<a href="http://lists.racket-lang.org/users" target="_blank">http://lists.racket-lang.org/users</a><br>
</div></div></blockquote></div><br></div></div>