I've been playing around with a simple AVL tree that uses the
split/join operations that Adams originally applied to weight-balanced
binary trees[1] and then Blelloch, Ferizovic, and Sun later applied to
other kinds of balanced binary trees.[2] The latter paper concentrates
on how certain operation
Thanks for the feedback! I opened a pull request for the docs:
https://github.com/racket/typed-racket/pull/886
Happy to continue the discussion over there.
(The example I added to the guide is maybe too simple.)
--
You received this message because you are subscribed to the Google Groups
"Rack
Racklog is a port to more-idiomatic Racket of the Schelog system [1]
by Dorai Sitaram. The idea of Schelog was not to be a high-performance
implementation of Prolog, but to use continuations to allow smooth
integration between Prolog-style search and more conventional
computation, while maintaining
>From time to time, I test Racklog, in the hope that the Racket team
replaced it with something more efficient. After all, there are many good
implementations of Prolog like languages around. I simply cannot understand
why Racket must be packed with a ridiculously slow piece of software, such
a
Brilliant. Downloaded, installed, works great. Thanks, Matthew.
On Wed, Dec 11, 2019 at 11:00 AM Matthew Flatt wrote:
> At the moment, we don't have plans to rebuild v7.5, so the change would
> kick in with v7.6.
>
> The snapshot builds use HFS+ --- but they did, anyway, since they're
> create
On Saturday, December 7, 2019 at 3:04:25 PM UTC+1, Ben Greenman wrote:
>
> On 12/7/19, Marc Kaufmann > wrote:
> > Thanks Ben and Jon, that did the trick.
> >
> > I realized when following the code that the structure wasn't exported -
> but
> >
> > I didn't know how to work around that. I no
Thanks. Yes, I realized that the two gave the same answer, but for
debugging I tried to see if it was different. I think I now see where I am
thinking about this in the wrong way. I thought `(U A B)` means 'it is
either of type A or of type B', with the implication that it picks the more
string
At the moment, we don't have plans to rebuild v7.5, so the change would
kick in with v7.6.
The snapshot builds use HFS+ --- but they did, anyway, since they're
created with an older version of Mac OS.
At Wed, 11 Dec 2019 10:45:08 -0500, David Storrs wrote:
> Thanks, Matthew,
>
> The version on t
Hi,
if possible, I'd like to use web server continuations with
`(send/suspend/dispatch...)`. However, currently I need to return something
of type `response?`, but when send/suspend/dispatch (and friends) don't
return a response - they send it to the client and return `Any` (or other
types).
Thanks, Matthew,
The version on the downloads page seems to still be APFS. Will it rebuild
at some point?
On Tue, Dec 10, 2019 at 8:46 PM Matthew Flatt wrote:
> I’ve changed the distribution build to use HFS+ going forward.
>
> > On Dec 10, 2019, at 6:28 PM, James Platt wrote:
> >
> >
> >> On
First, (U Any response) is the same as (U response Any) which is the
same as Any -- Any includes all other types and thus includes
response.
Second, f4 really is breaking the contract -- the contract Any turns
into says: don't try to pass through any "interesting" values, or if
you do, the other s
And I forgot: What is the cryptic error message 'any-wrap/c: Unable to
protect opaque value passed as `Any`' telling me? That response is opaque
and ... what?
Cheers,
Marc
On Wednesday, December 11, 2019 at 2:31:37 PM UTC+1, Marc Kaufmann wrote:
>
> Hello,
>
> I have one file called `type-test.
Hello,
I have one file called `type-test.rkt` with the following (notice that I
discovered that there is a typed version of the web-server/http module,
which solves another of my issues):
```
#lang typed/racket
(require (only-in typed/web-server/http response/xexpr response))
(provide f1 f2 f
13 matches
Mail list logo
