Fibonacci Sequence - Scheme Typing CST Test
Loading…
Fibonacci Sequence — Scheme Code
Generates first 10 Fibonacci numbers.
(define (fib n)
(if (< n 2) n
(+ (fib (- n 1)) (fib (- n 2)))))
(for-each (lambda (i) (display (fib i)) (newline)) (iota 10))Scheme Language Guide
Scheme is a minimalist, functional programming language in the Lisp family, emphasizing recursion, first-class functions, and symbolic computation. It is widely used in education, research, and AI for its simplicity and powerful abstraction capabilities.
Primary Use Cases
- ▸Functional programming education
- ▸Symbolic computation and AI
- ▸DSL (domain-specific language) design
- ▸Prototyping algorithms
- ▸Scripting within research software
- ▸Teaching recursion and higher-order functions
Notable Features
- ▸Minimalist syntax and semantics
- ▸First-class functions and closures
- ▸Tail-call optimization
- ▸Powerful macro system
- ▸Lexical scoping and recursion
Origin & Creator
Scheme was developed in the 1970s by Guy L. Steele and Gerald Jay Sussman at MIT as a simplified, cleaner dialect of Lisp.
Industrial Note
Scheme is primarily used in academia, language design research, AI prototyping, symbolic mathematics, and educational platforms like introductory computer science courses.