Symbolic Computation

• Lisp and Scheme are interactive languages

• Numbers, booleans, and symbols

  • Numerals have numbers as their values
  • The booleans #T and #F
  • Symbols, like PETER, must be assigned a value

• Predicates

  • e.g., NUMBER?, BOOLEAN?

• Prefix notation and arithmetic operators

  • Statements have the form (function arg ... arg), e.g.,
    • (+ 2 5)
    • (NUMBER? 5)
    • (BOOLEAN? #T)

Next slide

Back to first slide

View graphic version