CS 330: Lecture 35 – Call-by-need
Dear students, Last time we introduced a different way of passing parameters. Instead of eagerly evaluating them, we delayed evaluation until they were referenced inside the function. We looked at two examples of delaying evaluation: C preprocessor macros and writing our own control structures. I want to discuss the first of these a little bit […]
CS 318: Final Presentation
Your final in this course is to finalize your project, reflect on it, and present a demonstration of your work during the final week of class. We will not meet during the final exam period. Task 1: Present During the final week of class, give a 6- to 8-minute presentation of your site. To receive […]
CS 330: Lecture 34 – Call-by-name
Dear students, When you call a function, what happens? In particular, what happens in this code? int m() { cout << "m" << std::endl; return 5; } int r() { cout << "r" << std::endl; return 7; } int multiply(int a, int b) { cout << "*" << std::endl; return a * b; } int […]
CS 330: Lecture 33 – Closures Continued
Dear students, Last time we ended in the middle of a discussion about the dangers of closures oversharing values. We fixed the situation by adding a function to introduce a new scope for each closure so they wouldn’t clobber each others’ state. This situation happens frequently enough in Javascript that there’s a slightly simpler idiom […]
CS 330: Lecture 32 – Closures
Dear students, Let’s start with a Program This! Consider the foreach algorithm: for each item in list do something with that item (call a method, print, etc.) The core idea is that we have a list of items, and we want to produce some side effect for each of them. The foreach algorithm doesn’t return […]
CS 318: Lab 22 – Flexbox
Dear students, Today we hit up the new Flexbox system of CSS. In short, Flexbox allows us to control the distribution, alignment, order, and expansion of a bunch children within their parent. It replaces many of the hacks of float and Javascript to achieve certain layouts. We’re going to dive right into the lab today. […]
CS 330: Lecture 31 – HOFs and Lambdas in Java
Dear students, Is Haskell the only language that supports composition and higher-order functions? No. Does Java? It can be made to! Let’s do that today. We start by porting the . operator. What do you suppose the type signature of . is in Haskell? Well, it takes in two functions and gives back a new […]
CS 318: Project Prototype 2 – due May 9
Your next milestone in the project is to iterate on the first digital prototype of your site. You will present this second draft of your prototype to randomly assigned classmates for another round of evaluation. Task 1: Iteration on Your Prototype Create a second draft of your site in a folder named prototype2 in your […]
CS 318: Lab 21 – Peer Review
Dear students, Today is peer review day. You will examine three peers projects and give mostly anonymous written feedback. You will spend 15 minutes examining each site in detail. Look for functional issues, like these: Try to break it by resizing the window and locate weird interactions with links or menus. Are there broken links […]
CS 330: Lecture 30 – Haskell IO Continued
Dear students, Last time we introduced ourselves to Haskell’s world of purity and its world of side effects. We learned that any value that gets created in the world of side effects is packaged up in an IO wrapper using the return function. We can unpackage such wrappers using the <- operator. We will finish […]