This document discusses the programming language Scheme. It outlines that Scheme is a functional programming language that emphasizes minimalism and uses lambda calculus. It has no loops like "for" or "while", instead using recursion. The document also explains how Scheme can be used to represent mathematical concepts like lambda calculus. Finally, it mentions Scheme's ability to implement itself through "metalinguistic abstraction".

1. SCHEME
Functional programming language
SA12225089
王知践

2. OUTLINE

Features

Art of Mathematics

Wonders of magic

3. FEATURES
No For
 No while
 ……

Minimalism
 Lambda calculus
 Block structure
 Proper tail recursion


4. FEATURES
(*
(+ 2
(* 4 6)
)
(+ 3 5 7)
)

5. ART OF MATHEMATICS

E.g. Lambda calculus in mathematic

6. ART OF MATHEMATICS

E.g. Lambda calculus in Scheme

((lambda (a b) (+ a b)) 1 2)

"lambda" as a keyword for introducing a procedure
(Anonymous function).

using lambda expressions not as simple procedure
instantiations but as "control structures and
environment modifiers.
( 1 + 2 = 3)

7. WONDERS OF MAGIC

8. WONDERS OF MAGIC

9. WONDERS OF MAGIC

Metalinguistic abstraction

Scheme use itself to implement interpreters
and compilers of itself.

10. ESOTERIC