The Scheme Programming Language (book examples)
E571520
The Scheme Programming Language (book examples) is a collection of illustrative code samples demonstrating the features and idioms of the Scheme language, specifically written for and run on the Chez Scheme implementation.
All labels observed (1)
| Label | Occurrences |
|---|---|
| The Scheme Programming Language (book examples) canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6145097 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: The Scheme Programming Language (book examples) Context triple: [Chez Scheme, usedIn, The Scheme Programming Language (book examples)]
-
A.
Chez Scheme
Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
-
B.
Revised^n Report on the Algorithmic Language Scheme
The Revised^n Report on the Algorithmic Language Scheme is the series of formal documents that define and evolve the official specification of the Scheme programming language.
-
C.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
-
D.
PLT Scheme
PLT Scheme is the original name of the programming language and environment that later evolved into Racket, known for its powerful support of functional and language-oriented programming.
-
E.
MIT Scheme
MIT Scheme is a long-standing, feature-rich implementation of the Scheme programming language developed at the Massachusetts Institute of Technology, often used for teaching and research in computer science.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: The Scheme Programming Language (book examples) Target entity description: The Scheme Programming Language (book examples) is a collection of illustrative code samples demonstrating the features and idioms of the Scheme language, specifically written for and run on the Chez Scheme implementation.
-
A.
Chez Scheme
Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
-
B.
Revised^n Report on the Algorithmic Language Scheme
The Revised^n Report on the Algorithmic Language Scheme is the series of formal documents that define and evolve the official specification of the Scheme programming language.
-
C.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
-
D.
PLT Scheme
PLT Scheme is the original name of the programming language and environment that later evolved into Racket, known for its powerful support of functional and language-oriented programming.
-
E.
MIT Scheme
MIT Scheme is a long-standing, feature-rich implementation of the Scheme programming language developed at the Massachusetts Institute of Technology, often used for teaching and research in computer science.
- F. None of above. chosen
Statements (42)
| Predicate | Object |
|---|---|
| instanceOf |
code example collection
ⓘ
software artifact ⓘ |
| audience |
Scheme learners
ⓘ
programming language students ⓘ readers of "The Scheme Programming Language" ⓘ |
| author | R. Kent Dybvig NERFINISHED ⓘ |
| basedOn | The Scheme Programming Language NERFINISHED ⓘ |
| contains |
I/O examples
ⓘ
concurrency or thread examples ⓘ continuation examples ⓘ control-structure examples ⓘ higher-order procedures ⓘ lazy evaluation examples ⓘ list-processing examples ⓘ macros ⓘ module examples ⓘ numeric computation examples ⓘ record-type examples ⓘ syntax-rules examples ⓘ |
| distributionForm | downloadable source code ⓘ |
| documentation | commented Scheme source files ⓘ |
| executionEnvironment |
Chez Scheme REPL
NERFINISHED
ⓘ
Chez Scheme compiler NERFINISHED ⓘ |
| implementationTarget | Chez Scheme NERFINISHED ⓘ |
| language | Scheme NERFINISHED ⓘ |
| license | educational use ⓘ |
| medium | source code ⓘ |
| platform | Chez Scheme system NERFINISHED ⓘ |
| purpose |
demonstrate Scheme language features
ⓘ
illustrate Scheme idioms ⓘ serve as companion material to the book "The Scheme Programming Language" ⓘ |
| relatedWork | The Scheme Programming Language (book) NERFINISHED ⓘ |
| status | supporting material for a published textbook ⓘ |
| topic |
continuations
ⓘ
first-class procedures ⓘ functional programming ⓘ garbage-collected runtime behavior ⓘ lexical scoping ⓘ macro systems ⓘ tail recursion ⓘ |
| typicalFileExtension |
.scm
ⓘ
.ss ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: The Scheme Programming Language (book examples) Description of subject: The Scheme Programming Language (book examples) is a collection of illustrative code samples demonstrating the features and idioms of the Scheme language, specifically written for and run on the Chez Scheme implementation.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.