byu-cs-330-fall-2013

The student ratings for the course came in. You can get them here: http://faculty.cs.byu.edu/~jay/

I just posted the grades. On Thu, Dec 19, 2013 at 3:01 PM, Jay McCarthy <jay.mc...@gmail.com

Google "BYU Finals Schedule" On Thu, Dec 19, 2013 at 10:30 AM, Stephen Rollins <enzed.

Enjoy! http://faculty.cs.byu.edu/~jay/video/2013-Fall-330-prolog.webm -- Jay McCarthy <j...@cs.byu.

Correct. That name is not used anywhere in the assignment text. Sent from my iPhone On Dec 17, 2013,

It's pretty awesome, I think. And just 26 minutes. http://faculty.cs.byu.edu/~jay/video/2013-Fall

I made this change, btw. Please don't make me get in trouble. Jay On Wed, Dec 11, 2013 at 12:50

Yes, that's a sign your take-while is wrong On Wed, Dec 11, 2013 at 1:32 PM, Willard Hagen <

No. That's very important On Wed, Dec 11, 2013 at 3:54 PM, Willard Hagen <willard.hagen@gmail.

Ye On Tue, Dec 10, 2013 at 9:39 PM, Willard Hagen <willar...@gmail.com> wrote: > So

It's pretty slow Sent from my iPhone On Dec 10, 2013, at 4:52 PM, Willard Hagen <willard.hagen

That worked out better. I didn't realize there was an example of one in the video. :) On Tue, Dec

You get that error when a function only has definitions in its body: (define (f) (define a 1) (define

The second one gives you a specification. You can plug in any f and i, and it's a valid test. The

Nope. Just plan to defend with word. If you aren't sure, I can check for you Sent from my iPhone

On Mon, Dec 9, 2013 at 8:20 AM, Ben Draut <dra...@gmail.com> wrote: > How do we avoid cyclic

Thanks, that helped :)

Thank you, that makes much more sense. On Fri, Dec 6, 2013 at 11:25 PM, Jay McCarthy <jay.mccarthy

Provided it is clear that bif is tested On Wed, Dec 4, 2013 at 3:24 PM, Willard Hagen <willard.

On Wed, Dec 4, 2013 at 3:06 PM, Scott Heidbrink <scott.h...@gmail.com> wrote: > (build-

o ok that makes sense then. On Wednesday, December 4, 2013 2:32:27 PM UTC-7, Jay McCarthy wrote: (

https://github.com/get-bonus/get-bonus/blob/master/games/rpswar/fst.rkt -- Jay McCarthy <jay@cs.

BTW, sorry to miss your call... I was already asleep :) On Wed, Dec 4, 2013 at 6:46 AM, Jay McCarthy

http://faculty.cs.byu.edu/~jay/video/2013-Fall-330-typei.webm -- Jay McCarthy <j...@cs.byu.edu>

On Tue, Dec 3, 2013 at 4:58 PM, Stephen Rollins <enzed....@gmail.com> wrote: > I think

What list? The substitution is logically a map and has no ordering. You are not writing an

If the label of (fa) is E, then the constraint is f = a -> E Jay On Tue, Dec 3, 2013 at 1:00 PM,

Just in case this didn't get through, Does anyone have notes written on the board for the lecture

Yes On Tue, Dec 3, 2013 at 9:50 AM, Ben Draut <dra...@gmail.com> wrote: > In regular Racket,

I will not be asking for specific test cases, like curried map, etc. Instead, the test cases are