Creating lists in various ways...

Improving an iterative function in scheme...

Shorthand for car and cdr...

How to debug scheme if statment...

Getting same parity for a list of numbers...

Definition of success function...

Understanding church numerals...

From a pair to a list in lambda calculus / scheme...

Re-writing church numerals function...

How to add a counter to this scheme function...

Lambda calculus to scheme...

Let as syntactic sugar for lambda...

SICP 2.16 interval-arithmetic (scheme)...

How to do modulo in scheme...

SICP Exercise 1.11...

SICP Exercise 1.40 Issue...

What is the purpose of returning function from function?...

SICP exercise 1.18...

Why does my n-queens code return empty lists?...

Why is (not? (pair? x) [...]) beneficial over ((pair? x) [...])?...

Implementing or-odd, an or which ignores even-indexed arguments...

add support to new expression scheme language...

Is it still inadvisable to define constructors and selectors as cons, car, and cdr?...

Getting Edwin to open Scheme file correctly with C-x C-f...

Use mit-scheme with REPL and editor together...

Ternary conditions to find expmod?...

Without prior knowledge of Scheme's floor and rounding functions, how can SICP Exercise 1.45 (ma...

Suggested reading order and other questions...

Passing callable in lambda capture...

Why does my iterative higher-order procedure give more precise results than my equivalent recursive ...