What do students learn by programming in Scheme?

The main goal is to expose students to functional programming rather than letting them learn only the imperative or object-oriented style used by languages such as C++, Java, or Python. Scheme makes ideas like first-class functions, higher-order functions, lexical scope, closures, and the lambda calculus relatively direct to express.

It also fits naturally in a programming-languages or computer-science theory course. Because Scheme's syntax is simple and code has a close relationship to list structures, it is convenient for demonstrating interpreters, syntax trees, macros, evaluation rules, and the distinction between code and data.

Scheme has a small, consistent syntax, so instructors can spend less time teaching language mechanics and more time on programming concepts. Its emphasis on functions makes abstraction easier to study, while limited mutable state makes programs easier to reason about. Lists and recursive data structures also provide excellent practice with recursion, which many beginners find difficult.

A language like Scheme is useful because it removes a lot of incidental complexity. There are fewer keywords and conventions to memorize, so students can focus on decomposition, evaluation, abstraction, recursion, and how programs are represented as data. Those ideas transfer well even when the student later returns to more mainstream languages.

It depends partly on the course and the student. Some learners find the abstraction helpful, while others understand programming more easily once they can build concrete applications in a familiar imperative language. Scheme is not necessarily intended to be the language students use professionally; it is a compact tool for teaching a different way to think about programs.