Lec 31 - CS 61A : Metacircular Evaluation II
CS 61A : Metacircular Evaluation II CS 61A The Structure and Interpretation of Computer Programs Instructor Brian Harvey Spring 2008 Introduction to programming and computer science. This course exposes students to techniques of abstraction at several levels: (a) within a programming language, using higher-order functions, manifest types, data-directed programming, and message-passing; (b) between programming languages, using functional and rule-based languages as examples. It also relates these techniques to the practical problems of implementation of languages and algorithms on a von Neumann machine. There are several significant programming projects, programmed in a dialect of the LISP language.
Video is embedded from external source so embedding is not available.
Video is embedded from external source so download is not available.
Channels: Computer Science
Tags: uc berkeley computer science cs 61A course class yt:quality=high
Uploaded by: berkeleycs61a ( Send Message ) on 05-09-2012.
Duration: 50m 20s
Here is the next lecture for this course
Lec 29 - CS 61A : Metacircular Evaluation I
50:33 | 1836 views
Lec 31 - Computer Science 61A - metacircu ...
49:37 | 1495 views
Lec 32 - Computer Science 61A - metacircu ...
52:05 | 1540 views
Lec 1 - Computer Science 10 - Lecture 1: ...
45:17 | 4259 views
Lec 4 - Computer Science 10 - Lecture 4: ...
48:55 | 3826 views
Lec 2 - Computer Science 10 - Lecture 2: ...
48:52 | 4059 views
Lec 3 - Computer Science 10 - Lecture 3: ...
50:01 | 4875 views
Lec 5 - Computer Science 10 - Lecture 5: ...
44:07 | 3903 views
Lec 6 - Computer Science 10 - Lecture 6: ...
46:12 | 3666 views
Lec 7 - Computer Science 10 - Lecture 7: ...
51:36 | 3673 views
Lec 8 - Computer Science 10 - Lecture 8: ...
50:05 | 3579 views
Lec 9 - Computer Science 10 - Lecture 9: ...
48:23 | 3564 views
Lec 10 - Computer Science 10 - Lecture 10 ...
46:40 | 3820 views
Lec 11 - Computer Science 10 - Lecture 11 ...
46:43 | 3557 views
Lec 12 - Computer Science 10 - Lecture 12 ...
48:45 | 4132 viewsNo content is added to this lecture.
This video is a part of a lecture series from of berkeley
Lecture list for this course
Lec 1 - CS 61A Functional Programming I
Lec 2 - CS 61A Functional Programming II
Lec 3 - CS 61A : Functions of Functions
Lec 4 - CS 61A : Higher-Order Procedures
Lec 5 - CS 61A : Recursion and Iteration II
Lec 6 - CS 61A : UI Recursion and Iteration III
Lec 7 - CS 61A : Data Abstraction, Sequences Calculator I
Lec 8 - CS 61A : Data Abstraction, Sequences Calculator II
Lec 9 - CS 61A : Data Abstraction, Sequences Calculator III
Lec 10 - CS 61A Lecture 12: Hierarchical Data
Lec 11 - CS 61A Lecture 13: Hierarchical Data II
Lec 12 - CS 61A Lecture 14: Interpreter
Lec 13 - CS 61A : Generic Operators I
Lec 14 - CS 61A : Generic Operators II
Lec 15 - CS 61A : Object-Oriented Programming I
Lec 16 - CS 61A : Object-Oriented Programming II
Lec 17 - CS 61A : Object-Oriented Programming III
Lec 18 - CS 61A : Assignment, State, Environments I
Lec 19 - CS 61A : Assignment, State, Environments II
Lec 20 - CS 61A : Mutable Data
Lec 22 - CS 61A : Assignment, State, Environments III
Lec 24 - CS 61A : Client Server
Lec 25 - CS 61A : Concurrency I
Lec 26 - CS 61A : Concurrency II
Lec 28 - CS 61A : Shell Programming I
Lec 29 - CS 61A : Metacircular Evaluation I
Lec 30 - CS 61A : Shell Programming II
Lec 33 - CS 61A : Mapreduce II
Lec 34 - CS 61A : Analyzing Eval
Lec 36 - CS 61A : Lazy Evaluation I
Lec 37 - CS 61A : Nondeterministic Evaluation
Lec 38 - CS 61A : Logic Programming I