"Lec 37- Computer Science 61A - logic programming"The Structure and Interpretation of Computer Programs
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: Lec 37- Computer Science 61A - logic programming
Uploaded by: berkeleycomsc61A ( Send Message ) on 14-09-2012.
Duration: 52m 18s
No content is added to this lecture.
This video is a part of a lecture series from of Berkeley
Lec 1 - Computer Science 61A - functional programming 1
Lec 2 - Computer Science 61A - functional programming 2
Lec 3 - Computer Science 61A - higher-order procedures 1
Lec 4 - Computer Science 61A - higher-order procedures 2
Lec 5 - Computer Science 61A - user interface -Alan Kay-
Lec 6 - Computer Science 61A - user interface -Alan Kay-
Lec 7 - Computer Science 61A - recursion and iteration
Lec 8 - Computer Science 61A - orders of growth
Lec 9 - Computer Science 61A -data abstraction
Lec 10 - Computer Science 61A - sequences
Lec 11 - Computer Science 61A - : Example: calculator
Lec 12 - Computer Science 61A - hierarchical data
Lec 13 - Computer Science 61A - : hierarchical data
Lec 14 - Computer Science 61A - Example: Scheme-1 interpr
Lec 15 - Computer Science 61A - generic operators
Lec 16 Computer Science 61A - generic operators
Lec 17 -Computer Science 61A - object-oriented programmi
Lec 18- Computer Science 61A - object oriented programm
Lec19 - Computer Science 61A object-oriented programmi
Lec 20 - Computer Science 61A - : assignment and state
Lec 21- Computer Science 61A - : environments
Lec 22 -Computer Science 61A - environments
Lec 23 - Computer Science 61A - : mutable data
Lec 24 - Computer Science 61A - mutable data
Lec 25- Computer Science 61A - vectors
Lec 26 - Computer Science 61A - : client-server programming
Lec 27 - Computer Science 61A -: concurrency
Lec 28 - Computer Science 61A - : concurrency
Lec 29 -Computer Science 61A -: streams
Lec 30 -Computer Science 61A - Therac-25
Lec 31 - Computer Science 61A - metacircular evaluator -
Lec 32 - Computer Science 61A - metacircular evaluator -
Lec 33 - Computer Science 61A - mapreduce
Lec 34 -Computer Science 61A -: mapreduce
Lec 35 - Computer Science 61A - analyzing evaluator
Lec 36- Computer Science 61A -: lazy evaluator
Lec 38 - Computer Science 61A - : logic programming