CS 61A Lecture 4: Higher-Order Procedures
Loading...
Top Comments
All Comments (20)
-
@xssive405, Thanks, to say the true, decision came intuitively. I was watching one per day, as I remember. I've got purple book of wisdom, but have not enough time and energy to study, now... sad, but true.
-
@xssive405 By the by: On me NetBSD system with Gambit-C as scheme environment it does 100000 with no problems.
-
@TheNefski That's neat. Encapsulating the lambda within a lambda in order to label the function fn. Seems like the most direct approach. I wouldn' t have thought it up, but I've been watching all 4 videos straight in a row :) Which might be a bit too much at once.
-
I love how empty the classroom compared to week1 vid lol :)
-
@apilash BASIC (-:
-
Dumb syntax is first problem you get here, everything else seems actually simple to me. Why can't let ((N1 V1) (N2 V2) ... (Nn Vn)) have syntax like let {N1:V1; N2:V2; ... Nn:Vn}. Why create all that mess with "different kind of parenthesis"?..
-
@apilash Java
-
what language is good to start with? please reply :d
-
@TheNefski Brilliant!
41 videosComputer Science 61A - Spring 2008- 49:42
CS 61A Lecture 3: Functions of Functionsby UCBerkeley10,981 views
- 42:06
CS 61A Lecture 8: UI Recursion and Iteration IIIby UCBerkeley8,946 views
- 50:52
CS 61A Lecture 7: Recursion and Iteration IIby UCBerkeley5,930 views
- 51:10
CS 61A Lecture 9: Data Abstraction, Sequences Calculator Iby UCBerkeley5,040 views
- 49:02
CS 61A Lecture 34: Mapreduce Iby UCBerkeley22,211 views
- 50:05
CS 61A Lecture 42: Logic Programming IIby UCBerkeley6,772 views
- 46:39
CS 61A Lecture 30: Shell Programming Iby UCBerkeley19,737 views
- 51:29
CS 61A Lecture 18: Object-Oriented Programming IIby UCBerkeley10,550 views
- 47:08
CS 61B Lecture 25: Binary Search Treesby UCBerkeley59,553 views
- 51:23
CS 61B Lecture 3: Defining Classesby UCBerkeley34,804 views
- 45:08
Unix Shell Programming-Iby ignousocis95,266 views
- 44:33
CS 61A Lecture 40: Nondeterministic Evaluationby UCBerkeley3,591 views
- 31:20
CS 61A Lecture 43: Review Iby UCBerkeley4,777 views
- 48:09
CS 61B Lecture 6: Iteration and Arrays IIby UCBerkeley18,436 views
- 52:03
CS 61B Lecture 7: Linked Lists Iby UCBerkeley65,044 views
- 50:33
CS 61A Lecture 32: Metacircular Evaluation Iby UCBerkeley2,653 views
- 50:54
Computer Science 61A - Lecture 1: functional programming 1by UCBerkeley6,946 views
- 44:23
CS 61A Lecture 31: Shell Programming IIby UCBerkeley5,438 views
- 50:14
CS 61A Lecture 15: Generic Operators Iby UCBerkeley2,634 views
- 48:36
CS 61A Lecture 11: Data Abstraction, Sequences Calculator IIIby UCBerkeley2,743 views
Lectures 5, 6, and 7 are marked private. You can find them in Real video and MP3 formats via Google search for "webcast cs61a spring 2008"
random2929 2 years ago 7
The example code is written in Scheme. The functions described on the board between 4:05 and 7:30 correspond to Python's map (every), filter (keep), and reduce (accumulate), which are also designed to work with lambda functions.
banzaimonkey 1 year ago 2