Massachusetts Institute of Technology
Professor Albert R. Meyer
6.044J/18.423J: Computability Theory of and with Scheme
Fall, 1998
MIT 6.044J/18.423J, Fall 1998
Handouts
Handout 9 on Scheme Computability
(ps)
,
(LaTeX source)
.
Problem Set 6 due Friday, November 13
(ps)
,
(LaTeX source)
Scheme Grammars and Syntactic Values:
(ps)
,
(LaTeX source)
Problem Set 5 due Monday, November 2
(ps)
,
(LaTeX source)
Problem Set 4 due Friday, October 23
(ps)
,
(LaTeX source)
Checking Equational Proofs:
proof-check.scm
Transforming a Tree Proof into a Substitution Proof.
Axioms for polynomials.
Notes on Flattening Polynomial Products
Course LaTeX macros
Pattern Matching and Scheme Substitution Model Code
gzipped tar'ed package of all the following matching and substitution model files:
submodel.tgz
README
match.scm
deriv-simplify-rules.scm
eliza.scm
mitscheme-loadsm.scm
drscheme-loadsm.scm
other-loadsm.scm
sm.scm
test-submodel.scm
Scheme
Getting a Scheme System
MIT Scheme
(from the 6.001 website).
DrScheme
, a recommended Scheme system for students.
EdScheme
, a commercial Scheme system for students.
R5RS
, the latest official reference manual for Scheme.
The Scheme home page
Scheme Texts
There is a
6.044 email Forum
which broadcasts to class participants. Messages are archived in
archive-6044-forum
.
Fall 96 homepage
Copyright © 1998 Albert R. Meyer. All rights reserved.
Last modified: Sun Apr 14 01:59:08 EDT 2002