How to Design Programs
E1537645
UNEXPLORED
How to Design Programs is an influential introductory computer science textbook that teaches systematic program design and problem-solving using the Scheme programming language.
All labels observed (1)
| Label | Occurrences |
|---|---|
| How to Design Programs canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T22445311 — 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.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: How to Design Programs Context triple: [PLT Scheme, usedIn, How to Design Programs]
-
A.
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.
-
B.
The Practice of Programming
The Practice of Programming is a widely respected book by Brian W. Kernighan and Rob Pike that teaches practical software development techniques, emphasizing clear code, debugging, testing, and performance.
-
C.
The Scheme Programming Language (book examples)
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.
-
D.
Algorithms + Data Structures = Programs
"Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
-
E.
A Discipline of Programming
A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: How to Design Programs Target entity description: How to Design Programs is an influential introductory computer science textbook that teaches systematic program design and problem-solving using the Scheme programming language.
-
A.
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.
-
B.
The Practice of Programming
The Practice of Programming is a widely respected book by Brian W. Kernighan and Rob Pike that teaches practical software development techniques, emphasizing clear code, debugging, testing, and performance.
-
C.
The Scheme Programming Language (book examples)
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.
-
D.
Algorithms + Data Structures = Programs
"Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
-
E.
A Discipline of Programming
A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.