On Tue, Jul 6, 2010 at 7:00 PM, Neil Toronto wrote:
> I'd like to use Typed Racket to create an interpreter for a typed lambda
> calculus, which *inherits* Typed Racket's type system. (In other words, I'm
> lazy and I don't want to make my own type system. But who does? Except maybe
> Sam? :p) I w
I'd like to use Typed Racket to create an interpreter for a typed lambda
calculus, which *inherits* Typed Racket's type system. (In other words,
I'm lazy and I don't want to make my own type system. But who does?
Except maybe Sam? :p) I was counting on occurrence typing to allow me to
do it whi
my base case the function should return a
list of words but before returned a single word.
Very good decision. Now take a close look at how you phrased the second
condition. According to the design recipe, it should be structured to match
the second condition of your data definition for list-of-
> Exercise 12.4.2 is notorius. When looking to (list 'a 'b 'c), you should
> exspect 6 distinct permutations.
> Jos
Thanks for your response but that really doesn't help me much. I'm
focusing on insert-everywhere/in-single-word now. I understand what
arrangements does
and what permutations to expe
Amen.
-- Make sure you truly understand list vs cons. If you have any
doubts, stick to cons.
-- For your template, spell out what each expression produces before
you finish the definition.
-- Use the examples, especially the ones that fail.
-- Figure out what you need to combine the piece
Hi Sam --
As Jos commented, this is a very tough exercise, but it looks like you're
off to a good start.
The most obvious problem with your current solution lies with
'insert-everywhere/in-single-word.' My first suggestion is to check the
function examples to make sure the values they expect are
Exercise 12.4.2 is notorius. When looking to (list 'a 'b 'c), you should
exspect 6 distinct permutations.
Jos
> -Original Message-
> From: users-boun...@racket-lang.org
> [mailto:users-boun...@racket-lang.org] On Behalf Of Sam Griff
> Sent: 06 July 2010 20:00
> To: users@racket-lang.org
>
Boston Lisp Meeting:
Monday 2010-07-26
Slava Pestov on Factor: an interactive, dynamic, stack-based programming
language
http://fare.livejournal.com/157280.html
A Boston Lisp Meet
This has been reported and fixed in Git already.
On Sat, Jul 3, 2010 at 2:58 PM, Nadeem Abdul Hamid wrote:
> Running the extended example in this section:
> http://docs.racket-lang.org/web-server/servlet.html?q=box#(part._web-cells)
> gives me:
> exception: continuation application: attempt to
Hello. Like many others working through HtDP I have hit the wall at
this exercise. I'm not sure what I have so far is in line with the
"proper" way to do this exercise and would appreciate any
help/suggestions. Here is the code I have so far:
;; A list of words is either
;; 1. empty
;; 2. (cons w
Todd O'Bryan wrote:
OK, this is harder than I thought. The struct is defined at the top
level, so under what conditions might it be re-defined?
Also, will an accessor of the form struct-name-field work with any
struct of name struct-name, or does it only work with structs that are
in the same sc
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hey there.
I have noticed a problem (bug?) with Racket regarding packages
downloaded from planet. The thing is, the last package installed
overwrites the cache.rktd file, leaving only itself as an entry. That
automatically makes everything installed n
12 matches
Mail list logo
