Massachusetts Institute of Technology
6.844, Spring 03: Computability Theory of and with Scheme
Prof. Albert Meyer
Course Notes 4
March 12
revised March 14, 2003, 826 minutes
Term Models & Equational Completeness
We can generalize the theory of Arithmetic
Massachusetts Institute of Technology 6.844, Spring '03: Computability Theory of and with Scheme Prof. Albert Meyer
Course Notes 2 February 24
revised February 28, 2003, 641 minutes
Substitution into Arithmetic Equations 1 Proof of the Substitution Lemma
Massachusetts Institute of Technology 6.844, Spring '03: Computability Theory of and with Scheme Prof. Albert Meyer
Course Notes 3 March 6
revised May 13, 2003, 1203 minutes
A Substitution Model for Scheme
1
Introduction
These notes describe a Scheme Subs
Massachusetts Institute of Technology
6.844, Spring 03: Computability Theory of and with Scheme
Prof. Albert Meyer
Course Notes 8
April 22
revised April 28, 2003, 1231 minutes
The Word Problem for Semigroups
1 Semigroup Equations
In these notes we conside
Course Projects
The final project is due at the beginning of lecture on Wednesday, May 14, the last day of class. Possible projects include: 1. Any course-related project you believe will be valuable for yourself and/or will enrich the course materials fo
6.001, Fall 2002-Project 3 MASSACHVSETTS INSTITVTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.001-Structure and Interpretation of Computer Programs Fall 2002 Project 3 Issued: Week 11 / Day 5 Due: Part I, Week 12 / Day 5, by
Massachusetts Institute of Technology
6.844, Spring 03: Computability Theory of and with Scheme
Prof. Albert Meyer
April 4
revised April 7, 2003, 834 minutes
Problem Set 1
Due: April 13
Problem 1. Prove Theorem 4.5.22 (termmodel completeness for simply ty
Massachusetts Institute of Technology 6.844, Spring '03: Computability Theory of and with Scheme Prof. Albert Meyer
Course Notes 7 April 22
revised April 22, 2003, 1115 minutes
Compiling Scheme to a Micro2 computer
1 Microsquaredcomputers
In the Theory of
Continuations
This note provides some additional background on continuations, and their use in controlling
the ow of computation within a process.
Continuations approach control ow dierently than standard Scheme code. Rather than writ
ing procedures that
Massachusetts Institute of Technology 6.844, Spring '03: Computability Theory of and with Scheme Prof. Albert Meyer
Course Notes 9 April 22
revised April 30, 2003, 1115 minutes
Firstorder Theory of Concatenation
Problem 1. Let C be a 2CM with n instructio
Massachusetts Institute of Technology
6.844, Spring 03: Computability Theory of and with Scheme
Prof. Albert Meyer
Course Notes 6
April 22
revised May 6, 2003, 10 minutes
Scheme Computability, Part II
1 The Recursion Theorem
The Recursion Theorem synthesi
Massachusetts Institute of Technology
6.844, Spring 03: Computability Theory of and with Scheme
Prof. Albert Meyer
Course Notes 5
April 16
revised May 9, 2003, 1138 minutes
Scheme Computability
What can and cant Scheme do? We can begin to pin this questio
Massachusetts Institute of Technology
6.844, Spring 03: Computability Theory of and with Scheme
Prof. Albert Meyer
Course Notes 1
February 10
revised February 25, 2003, 1300 minutes
Notes on Proving Arithmetic Equations
1 Expressions and Values
In these n