Computer Science 433
Programming Languages

Fall 2014, The College of Saint Rose

Home     Syllabus     Schedule

Agenda

• Announcements
• Program/Problem Set 3: Tokenizer for Little C [HTML] [PDF] due tonight
• Program/Problem Set 4: Parser for Little C [HTML] [PDF] due next week
• Lecture 7 assignment recap
• Functional programming with Scheme
  • basics
  • REPL
  • data types in Scheme
  • lists in Scheme
  • writing Scheme functions

Lecture 8 Assignment

Due at the start of class, Wednesday, September 24.

Please submit answers to these questions in Submission Box under "LA8" or in hard copy by the start of our next class. We will discuss these questions at the start of class, so no late submissions are accepted. Please be sure that your name is clearly indicated in all submissions.

The readings for next class are the MIT/GNU Scheme documentation sections referenced in the topic notes.

• (4 points, 1 each) Write a Scheme function that computes each of the following:

  5 - 3 * 2 + 7
  10 * 3 * 9 / 4
  (5 + 8) / (9 -3)
  5 + 8 / 9 - 3
  

Terminology

• functional programming
• composite functions
• higher-order functions, functional forms
• functions defined as lists
• exactness
• predicate functions
• atoms vs. lists
• car and cdr

Examples

• hello_scheme
• area

Links

• The Scala Programming Language
• Clojure
• MIT/GNU Scheme 9.1 Reference Manual
• MIT/GNU Scheme 9.1 Users Manual
• MIT/GNU Scheme Exactness documentation
• MIT/GNU Scheme Numerical Operations documentation
• MIT/GNU Scheme Strings documentation