-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 27-02-13 21:51, Neil Toronto wrote:
> (An example that came up in the implementation of matrix norms: the
> type of (sqrt (/ 1 x)) isn't Nonnegative-Real if x :
> Nonnegative-Real, but Complex. Consider x = -0.0. Without TR's
> complaints, `matrix-
I am at Northeastern. I use my own address as a central point for the
multiple present and past addresses, and usually don't bother
spoofing the `from' header. Perhaps I'll add a note about that to my
email signature.
Thanks for the tips about reduction semantics!
I've created a pull request.
W
Yeah, I agree it does make sense to do this kind of merging with examples
like the one you posted or else you get very very bad performance in
matching. And the merging is coming about because of the way the language
is structured; it isn't accidental "lucky" merging; you expect the same
production
Attached is a patch that adds a keyword, #spaces, to `define-cite', which makes
the generate bibliography have N spaces between each entry.
(define-cite ... g #:spaces 2)
(g)
..output..
[1] entry 1
[2] entry 2
If it looks ok I can push it, and update the docs as well.
diff --git a/collects/sc
By the way, when I was tinkering, I originally got my example working
*without* merging nts (lines 1967-1983). I only added it after
inspecting the output of `compiled-lang-lang'. The resulting
union-language had the same nonterminal in a language several times with
overlapping right-hand-sides, so
I had a feeling I was doing something wrong, but I'm not familiar enough
with the Redex source to do much more than hack until it does what I
want :)
Here is a small example of what I'd like to do:
https://gist.github.com/bluephoenix47/5059837
This example seems to work with my patch, but obviou
The reason I didn't do that is very much related to lines 1967-1983 in your
diff.
That isn't a good idea: what you really want to do there is check to see if
different patterns generate the same languages or not. But that's not
something that is easily done (I'm guessing it is computable, but very
Hello all,
I've been hacking on some languages in Redex, and found myself
abstracting commons parts into base languages, and gradually building new
languages via `define-extended-language' and `define-union-language'.
Unfortunately, I hit a wall when I discovered `define-union-language'
doesn't l
FWIW, I wouldn't mind if someone wanted to add a flag to "raco test" that
took a collection (or subcollection) and followed some standardized way to
test it. I think that would help us bring the collections in line to test
them that way.
It would probably work best if we had someone that was actua
On Wed, Feb 27, 2013 at 2:34 PM, Danny Yoo wrote:
> On Wed, Feb 27, 2013 at 1:36 PM, Robby Findler
> wrote:
>> I think that currently you can look at what drdr does. That's the best we
>> have.
>
> I'll assume that this is the drdr collection in meta,
>
> http://git.racket-lang.org/plt/tree/H
10 matches
Mail list logo
