The source code for various, older, Scheme implementations can be found here. It is pretty interesting to read about the differing interests of the implementers.
(via comp.lang.scheme)
-
CONTENTS
Categories
-
RSS Links
-
Meta
Archives
Tag Archives: Learning
Source Code for Various Old Scheme Implementations
Friday, November 14, 2008
A Theory for Language Design
Thursday, November 6, 2008
No amount of language design can force a programmer to write clear programs. If the programmer’s conception of the problem is badly organized, then his programs will also be badly organized. The extent to which a programming language can help a programmer to organize his problem is precisely the extent to which it provides features [...]
Helium for learning Haskell
Monday, November 3, 2008
Helium is a user-friendly compiler designed especially for learning the functional programming language Haskell. The quality of the error messages has been the main concern both in the choice of the language features and in the implementation of the compiler. Helium implements almost full Haskell, where the most notable difference is the absence of type [...]
Why Calculating is Better than Scheming
Sunday, November 2, 2008
In 1987 Phil Wadler wrote the paper Why Calculating is Better than Scheming. It is an essay on the shortcomings of using Scheme as the programming language with which to teach beginning programmers in SICP, and how Miranda would have a better choice for teaching the software engineers of tomorrow. This was very fun for [...]
A peasant revolt against DrScheme!
Sunday, November 2, 2008
Here is an interesting thread in the PLT discussion archive discussing the want of beginning programmers only to learn things that are clearly useful!
(surely via the PLT Discussion list, but I can’t recall or find it…)
Notes on Introduction To Algorithms
Friday, October 17, 2008
Peteris Krumins has been posting his notes on MIT’s Introduction to Algorithms. The notes are valuable for anyone interested in working their way through the CLRS text and MIT Open Courseware videos.
(via LtU)
Computer Science Teachers Association
Wednesday, October 15, 2008
The Computer Science Teachers Association is a membership organization that supports and promotes the teaching of computer science and other computing disciplines. CSTA provides opportunities for K-12 teachers and students to better understand the computing disciplines and to more successfully prepare themselves to teach and learn.
Tuition-free MIT
Wednesday, October 15, 2008
What would the Massachusetts Institute of Technology look like if we did not charge undergraduates tuition?
HtDP Languages and Math
Wednesday, October 15, 2008
A comment by Matthais on the nature of the first three HtDP languages:
HtDP’s first three teaching languages are basically mathematics, ignoring the parentheses. We use
— arithmetic, for many different forms of data
— algebra, for (potentially conditional) function definitions
— pre-calculus, for induction and [...]
A Visual Interpreter for Students Learning Scheme
Sunday, October 5, 2008
Students who know procedural and object-oriented languages frequently have difficulty learning the functional paradigm. The purpose of this work is to facilitate this transition by designing and implementing a set of visual tools that help students understand how Scheme, a functional language, programs work. To achieve our goals we worked on the implementation of a [...]