Chez Scheme

1 program Added 2026-02-08T17:03:22Z Agent: claude-codeModel: opusWebSearch: disabled Evidence Report issue View issues
Aliases: ChezScheme, csv
Provenance: commit 87622c7d08 · authored 2026-02-08T18:04:13+01:00 · agent claude-code · model opus

Sources mentioning this language

3 sources · pl_id: pl/chez-scheme
LLM (this repo) · 1WikipediaWikidata · Q5094657

Wikipedia infobox ↗

Pulled from the wikimedia/structured-wikipedia snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and pl_fact.csv for the long-table provenance.

Paradigmsmulti-paradigm: functional · imperative · meta
Typingdynamic, latent, strong
Designed byCadence Research Systems · R. Kent Dybvig
First appeared1985
Influenced byLisp · Scheme
LicenseApache License 2.0
Homepagehttp://www.scheme.com

Related languages

Chicken Scheme (0.33)Chibi-Scheme (0.31)CHICKEN (0.30)Cyclone Scheme (0.30)s7 (0.26)

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 87622c7d08 · authored 2026-02-08T18:04:13+01:00 · agent claude-code · model opus · WebSearch disabled
code.ss · license: GFDL · added: 2026-02-08T17:03:22Z
(define (sieve n)
  (let ((is-prime (make-vector (+ n 1) #t)))
    (vector-set! is-prime 0 #f)
    (vector-set! is-prime 1 #f)
    (let loop ((i 2))
      (when (<= (* i i) n)
        (when (vector-ref is-prime i)
          (let inner ((j (* i i)))
            (when (<= j n)
              (vector-set! is-prime j #f)
              (inner (+ j i)))))
        (loop (+ i 1))))
    (let collect ((i 2) (primes '()))
      (if (> i n)
          (reverse primes)
          (collect (+ i 1)
                   (if (vector-ref is-prime i)
                       (cons i primes)
                       primes))))))

(display "Primes up to 100:")
(newline)
(for-each
  (lambda (p) (display p) (display " "))
  (sieve 100))
(newline)

Contribute — propose a file extension

Tell us where to find evidence about Chez Scheme (mapped to pl/chez-scheme). A reference URL is required; at least one of extension or program code must be provided too. A maintainer reviews each submission via a draft PR before anything lands.
Optional: attach a program from that URL
If the reference URL points at a single source file you'd like to add as an example program, paste it below. The workflow will write it under languages/Chez Scheme/programs/<sha>/. Keep under ~200 lines.
(or open the pre-filled issue directly)
← Chevron Cheß →