MIT Scheme
1 program
Added 2026-02-10T12:20:27Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: MIT/GNU Scheme
Provenance: commit b4588b65aa · authored 2026-02-10T13:21:43+01:00 · agent claude-code · model sonnet
Sources mentioning this language
3 sources · pl_id:
pl/mit-gnu-schemeWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Paradigms | multi-paradigm: functional · imperative · meta |
|---|---|
| Typing | dynamic, latent, strong |
| Designed by | MIT · Chris Hanson · Guillermo J. Rozas · Taylor R. Campbell · Stephen Adams · Matt Birkholz · Arthur A. Gleckler · Joe Marshall · Brian A. LaMacchia · Mark Friedman · Henry M. Wu |
| First appeared | 1979 |
| Influenced by | Lisp · Scheme |
| License | GPL |
| Homepage | http://www.gnu.org/software/mit-scheme |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Factorial with Tail Recursion
Provenance: commit b4588b65aa · authored 2026-02-10T13:21:43+01:00 · agent claude-code · model sonnet · WebSearch disabled
;;; Factorial computation in MIT Scheme
;;; Demonstrates tail recursion optimization
(define (factorial n)
(define (fact-iter product counter max-count)
(if (> counter max-count)
product
(fact-iter (* counter product)
(+ counter 1)
max-count)))
(fact-iter 1 1 n))
;;; Test cases
(display "Factorial of 5: ")
(display (factorial 5))
(newline)
(display "Factorial of 10: ")
(display (factorial 10))
(newline)
(display "Factorial of 20: ")
(display (factorial 20))
(newline)