Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

CS 61A Lecture 2: Functional Programming II

Loading...

Sign in or sign up now!
19,536
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Jul 30, 2008

CS 61A - Spring 08 - The Structure and Interpretation of Computer Programs

Instructor Brian Harvey

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.

http://www.cs.berkeley.edu

Category:

Education

Tags:

Download this video

LICENSE: Creative Commons (Attribution-Noncommercial-No Derivative Works).

For more information about this license, please read: http://creativecommons.org/licenses/by-nc-nd/3.0/.

High-quality MP4 Learn more

  • likes, 1 dislikes

Link to this comment:

Share to:

Top Comments

  • this guy is awesome....

    i love the way he teach

    he is super smart

  • fantastic

see all

All Comments (22)

Sign In or Sign Up now to post a comment!
  • @theincredibledouche if-else if-else clauses. Cond just stands for conditional, which every programming language contains.

  • @elizbethlogan One of the top rated universities in the world...

  • what kind of university is this?????? it doesn't have even a white board..

    .

  • im going to attend to this university but without paying it, thumbs up to who ever installed that camera!

  • gosh, all these computer science puns. lol.

  • @theincredibledouche Yes, it's called switch/case

  • is there some equivalent to cond in c++/c#?

  • @Rustferne yes, it would.

  • If you call the Pig Latin function with only consonants, wouldn't it recurse endlessly since no vowel is ever reached?

  • best teacher !

Loading...

0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more