Workspace

Scheme

minimal Lisp functional foundations and interpreter thinking

Definition first

What Scheme means

Scheme is a programming language for writing exact instructions, often used for minimal Lisp functional foundations and interpreter thinking. Start with one mental model: input goes through steps and becomes output.

Minimum run factsFile main.scmRun scheme --script main.scmHabit Evaluate one expression at a time and keep parentheses intentional
Program

An ordered set of instructions. It reads input, follows rules, and produces output.

Value and variable

A value is data. A variable is the name you use to hold and reuse that data.

Function

A named piece of work. It takes input, does one job, and can return a result.

Runtime

Scheme is the place that actually runs code from main.scm.

First readable code

Program output

entry point output syntax display
(display 42)
Output 42

Language lineage

Scheme family tree

See where Scheme comes from, which languages feel close, and what to learn next.

roots
LispLambda calculus
currentSchemeMinimal Lisp family
familyMinimal Lisp family
best used for

recursion, interpreters, and core programming ideas

Zero base path

1Read one rule2Predict output3Type from memory4Run checklist5Repeat with one change

Question bank

Search before practice

Pick a stage or search across the open programming bank. Jump straight to the matching drill.

18 matching questions
Q 1ChoiceStage 1 definitions

Scheme practice 1

Scheme question 1. Choose the statement that matches printing a value.

Q 2ChoiceStage 1 definitions

Scheme practice 2

Scheme question 2. Choose the statement that matches naming a value.

Q 3ChoiceStage 1 definitions

Scheme practice 3

Scheme question 3. Choose the statement that matches reusable function.

Q 4ChoiceStage 1 definitions

Scheme practice 4

Scheme question 4. Choose the statement that matches basic collection.

Q 5ChoiceStage 1 definitions

Scheme practice 5

Scheme question 5. Choose the statement that matches printing a value.

Q 6ChoiceStage 1 definitions

Scheme practice 6

Scheme question 6. Choose the statement that matches naming a value.

Q 7ChoiceStage 1 definitions

Scheme practice 7

Scheme question 7. Choose the statement that matches reusable function.

Q 8ChoiceStage 1 definitions

Scheme practice 8

Scheme question 8. Choose the statement that matches basic collection.

Q 9ChoiceStage 1 definitions

Scheme practice 9

Scheme question 9. Choose the statement that matches printing a value.

Q 10ChoiceStage 1 definitions

Scheme practice 10

Scheme question 10. Choose the statement that matches naming a value.

Q 11ChoiceStage 1 definitions

Scheme practice 11

Scheme question 11. Choose the statement that matches reusable function.

Q 12ChoiceStage 1 definitions

Scheme practice 12

Scheme question 12. Choose the statement that matches basic collection.

Q 13ChoiceStage 1 definitions

Scheme practice 13

Scheme question 13. Choose the statement that matches printing a value.

Q 14ChoiceStage 1 definitions

Scheme practice 14

Scheme question 14. Choose the statement that matches naming a value.

Q 15ChoiceStage 1 definitions

Scheme practice 15

Scheme question 15. Choose the statement that matches reusable function.

Q 16ChoiceStage 1 definitions

Scheme practice 16

Scheme question 16. Choose the statement that matches basic collection.

Q 17ChoiceStage 1 definitions

Scheme practice 17

Scheme question 17. Choose the statement that matches printing a value.

Q 18ChoiceStage 1 definitions

Scheme practice 18

Scheme question 18. Choose the statement that matches naming a value.

Multiple choice

Scheme practice 1

Q 1Choicenew

Scheme question 1. Choose the statement that matches printing a value.

(display 42)

Reference

Patterns for main.scm

Schemescheme --script main.scm
Recall from memoryRead a small point then write it back without looking
Trace the codeWrite variable values line by line before you run the answer
Type it yourselfCopy less type more and fix one small error at a time

entry point output syntax display

Program output

(display 42)
  • Run the smallest file first
  • Print one known value
  • Check the output before adding more code

variables assignment types define

Values and names

(define total 42)
(display total)
  • Give values readable names
  • Keep one idea per line while learning
  • Trace the value before changing it

function collection List

Functions and collections

(define (add a b)
  (+ a b))

(define scores '(40 2))
(display (length scores))
  • Keep functions small
  • Return useful values
  • Use the common collection before reaching for frameworks