InfoCoBuild

CS 61A: The Structure and Interpretation of Computer Programs

CS 61A: The Structure and Interpretation of Computer Programs (Spring 2011, UC Berkeley). Instructor: Professor Brian Harvey. An 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.

Lecture 43 - Logic Programming (Cont.)


Go to the Course Home or watch other lectures:

Lecture 01 - Functional Programming 1
Lecture 02 - Functional Programming 2
Lecture 03 - Higher-Order Procedures 1
Lecture 04 - Higher-Order Procedures 2
Lecture 05 - User Interface - Alan Kay
Lecture 06 - User Interface - Alan Kay (Cont.)
Lecture 07 - Orders of Growth
Lecture 08 - Recursion and Iteration
Lecture 09 - Data Abstraction
Lecture 10 - Sequences
Lecture 11 - Example: Calculator
Lecture 12 - Hierarchical Data
Lecture 13 - Hierarchical Data (Cont.)
Lecture 14 - Example: Scheme-1 Interpreter
Lecture 16 - Generic Operators
Lecture 17 - Generic Operators (Cont.)
Lecture 18 - Object-Oriented Programming 1
Lecture 19 - Object-Oriented Programming 2
Lecture 20 - Object-Oriented Programming 3
Lecture 21 - Assignment and State
Lecture 22 - Environments
Lecture 23 - Environments (Cont.)
Lecture 24 - Mutable Data
Lecture 25 - Mutable Data (Cont.)
Lecture 26 - Vectors
Lecture 30 - Client-Server Programming
Lecture 31 - Concurrency
Lecture 32 - Concurrency (Cont.)
Lecture 33 - Streams
Lecture 34 - Streams (Cont.)
Lecture 35 - Therac-25
Lecture 36 - Metacircular Evaluator
Lecture 37 - Metacircular Evaluator (Cont.)
Lecture 38 - Mapreduce
Lecture 39 - Mapreduce (Cont.)
Lecture 40 - Analyzing Evaluator
Lecture 41 - Lazy Evaluator
Lecture 42 - Logic Programming
Lecture 43 - Logic Programming (Cont.)
Lecture 44 - Review