Domain: scheme.com
Stories and comments across the archive that link to scheme.com.
Comments · 7
-
Re:Get the Little Schemer
Free resources for Scheme.
The classic, Structure and Interpretation of Computer Programs:
http://mitpress.mit.edu/sicp/full-text/book/book.html
SICP videos:
http://swiss.csail.mit.edu/classes/6.001/abelson-sussman-lectures/
How To Design Programs (somewhat PLT Scheme specific):
http://www.htdp.org/2003-09-26/Book/
The Scheme Programming Language (somewhat Chez Scheme specific):
http://www.scheme.com/tspl3/
Teach Yourself Scheme in Fixnum Days (also PLT to an extent):
http://www.ccs.neu.edu/home/dorai/t-y-scheme/t-y-scheme.html
Of course there are others, and most of these can be bought in dead-tree form. -
Re:Backwards System
Yet if they don't get it into print, it can't be used in a classroom setting.
Fortunately, this isn't always true! While taking my advanced operating systems course, we used Linux Device Drivers which is available online for free. This is also the case with my Programming Languages class where we learned and wrote an interpreter for Scheme. Then, in my computers and society class we used ESR's writings and Stallman's biography.
Maybe more topics could be covered in free format... Seems to me like Google is making life easier for some English courses and MIT already has opencourseware up and running.
Guess I went off on a tangent over one little line... :) -
Re:Recursive main()
-
Re:$9940
but doesn't one have to put up money for it to really be a scheme?
No, it doesn't have to cost money; it just has to optimize all tail calls.
-
Re:OT:Re:PCs are LBAs, and Halting for LBAs is sol
PROVE: if an LBA does not halt for a given input, then it will loop through the same state.
An LBA with k possible characters per cell, n cells, s possible states of the head, and p possible tape positions has p*s*k^n total states. This finite number of states is the major difference between an LBA and a TM. Therefore, if you run the machine for p*s*k^n + 1 states, it will have either halted or gone through a state more than once. The tortoise-and-hare method is a convenient optimization derived from a method given as an algorithm in The Scheme Programming Language to detect cyclic lists.
-
Toki Pona has 120 words
Is Spanish better than English? Does Japanese trump Swahili?
What about Toki Pona? It's a small spoken language with 120 words that don't inflect. Whether Toki Pona is small in a practical way or small in an impractical way is still up in the air.
-
Classics...
- Structure and Interpretation of Computer Programs
- Common Lisp HyperSpec
- Common Lisp the Language, 2. ed
- Common Lisp - A gentle Introduction to symbolic computation
- The Scheme Programming language, 2. ed
- Reflections on trusting trust
- Lisp: Good News, Bad News. How to Win Big
- John McCarthy's homepage
- Dennis Ritchie's homepage
- Various classic papers it's a shame ACM never bothered to continue adding to
- Another list of classic papers (this time related mostly to programming language design)
- GTK-Gnome Application Development (not a classic, though, as the field is too young)
- KDE 2.0 Development (not a classic though, as the field is too young)
- Eric Weissteins Mathworld
- Compilers and compiler generators - an introduction with C++ (although I'm not too sure if it deserves being called a classic...)
- Parsing techniques - A practical guide
- Art of assembly language programming (never was a dead tree, but good anyway)
- Paul Carters 386 assembly book (same comment as above)
- An Introduction to Scheme and its Implementation (see comment above)
- How to design programs - An introduction to programming and computing (not a classic, yet!)
- The Gutenberg archives contains much non-copyrighted classic fiction in ASCII format
- Sacred texts has copies of or links to many religious text for various major (or minor) religions