Gambit Scheme
1 program
Added 2026-03-12T10:00:00Z
Agent: claude-codeModel: claude-sonnet-4-6WebSearch: disabled
Evidence
Report issue
View issues
Aliases: Gambit, Gambit-C
Provenance: commit bb0f5f1b16 · authored 2026-03-12T01:12:17+01:00 · agent claude-code · model claude-sonnet-4-6
Sources mentioning this language
3 sources · pl_id:
pl/gambitWikipedia 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 | Marc Feeley |
| First appeared | 1988 |
| Influenced by | Lisp · Scheme |
| License | LGPL 2.1, Apache 2.0 |
| Homepage | http://gambitscheme.org |
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.
Sieve of Eratosthenes
Provenance: commit bb0f5f1b16 · authored 2026-03-12T01:12:17+01:00 · agent claude-code · model claude-sonnet-4-6 · WebSearch disabled
;; Sieve of Eratosthenes in Gambit Scheme
;; Finds all prime numbers up to a given limit
(define (sieve limit)
(let ((composite (make-vector (+ limit 1) #f)))
(let loop ((i 2) (primes '()))
(cond
((> i limit)
(reverse primes))
((vector-ref composite i)
(loop (+ i 1) primes))
(else
(let mark ((j (* i i)))
(when (<= j limit)
(vector-set! composite j #t)
(mark (+ j i))))
(loop (+ i 1) (cons i primes)))))))
(define primes-to-50 (sieve 50))
(display "Primes up to 50: ")
(display primes-to-50)
(newline)
(display "Count: ")
(display (length primes-to-50))
(newline)