On Sat, Dec 10, 2011 at 7:35 PM, Jeremiah Willcock wrote:
> On Sat, 10 Dec 2011, Sam Tobin-Hochstadt wrote:
>
>> On Sat, Dec 10, 2011 at 5:54 PM, Jeremiah Willcock
>> wrote:
>>>
>>> When I run the following program:
>>>
>>> #lang typed/racket
>>> (struct: A ((f : (HashTable Any Any
>>> (provi
On Sat, 10 Dec 2011, Sam Tobin-Hochstadt wrote:
On Sat, Dec 10, 2011 at 5:54 PM, Jeremiah Willcock wrote:
When I run the following program:
#lang typed/racket
(struct: A ((f : (HashTable Any Any
(provide (all-defined-out))
I get the error message:
racket-Linux-install/lib/racket/collect
On Sat, Dec 10, 2011 at 5:54 PM, Jeremiah Willcock wrote:
> When I run the following program:
>
> #lang typed/racket
> (struct: A ((f : (HashTable Any Any
> (provide (all-defined-out))
>
> I get the error message:
>
> racket-Linux-install/lib/racket/collects/racket/contract/private/hash.rkt:57
When I run the following program:
#lang typed/racket
(struct: A ((f : (HashTable Any Any
(provide (all-defined-out))
I get the error message:
racket-Linux-install/lib/racket/collects/racket/contract/private/hash.rkt:57:0:
hash/c: expected either a flat or chaperone contract for the domain,
To HTML parser experts,
I am trying to transform a div tag in the following HTML document:
(define an-html
(h:read-html
(open-input-string
(string-append
"My title"
"Hello worldreplace meTesting!"
""
I want replace me to read something like I am replaced.
I am tryin
Hi ,
When I read HTDP-Generative Recursion, I test quick-sort in Fig 68 and
all is right.
But when I try to replace "<" with "<=" in function "smaller-items" and
add new cond
"[(empty? (rest alon)) alon]" (do as the book Section 26 said), the new
quick-sort doesn't work and
run in a dead loo
6 matches
Mail list logo
