Final exams have been graded, and scores have been posted. They were scored on a 10-point scale as

Good luck, everyone, on your final exams this week. Remember that the time slots for the two sections

All assignments have been graded, and everyone should now have a score posted for each assignment. (

The wtypei assignment has been graded, and scores have been posted to the gradebook.

The wtypec assignment has been graded, and the scores have been posted to the gradebook. The last

And with that, all coding assignments have been graded. Remember, you can view the grades of all your

Yep, just translate those 5 cases from the book into code. You should be passing a list of

The whole point of a recursive construct is so that you can use the bound-id in the bound-body, so

In case you have any questions regarding the last assignments, I will be available this afternoon in

Yes, you need to test generate-constraints and unify separately, and these are given credit. The

Someone requested that I post this to the group: Section 1: Tuesday 4/19 @ 11am Section 2: Tuesday 4/

For today's classes, we will have a guest lecturer. Dr. Phillip J. Windley is founder and CTO of

No, a list can't be both numbers and booleans, because it would then be impossible to determine

The wgc assignment has been graded, and scores have been posted.

Here's a very simple starting point for generate-constraints: (define (generate-constraints e-id

That's correct. Having additional constraints doesn't hurt anything as long as they're

The caller passes into generate-constraints the label (type variable) for e. generate-constraints

It's easiest to just generate the constraints directly. The "+" operator tells you

When doing type inference by hand, it's tempting to just reason your way through it in your head

There isn't, at least to my knowledge. But you might find the "member" function useful.

See Section 9.3 of your textbook for why this is a problem. But this note is there more to let you

Write function to recursively traverse the AST (like interp or type-check). Have it take an

That's correct. We use the Cartesian product notation you hopefully saw in CS 236. We treat the

The wcont assignment has been graded, and scores have been posted to the gradebook.

Right. You can demonstrate (and get credit for) that working by testing infer-type with expressions

For type inference, it's not so much that a function's return type is unknown -- rather,

A description of the behavior of the "rec" construct can be found in Ch. 9 of your textbook

In class yesterday I said that I sent e-mail replies to anyone who did not get full credit on the

The wlang assignment has been graded. --- Bryan S. Morse BYU Computer Science mo...@cs.byu.edu http:/

The "wlazy" assignment has been graded. There seemed to be some fundamental