From 34cf5a625f2c055e0f7791c82b17013121a5fead Mon Sep 17 00:00:00 2001 From: Correl Roush Date: Wed, 29 Apr 2015 20:00:24 -0400 Subject: [PATCH] 5-3, 5-4 --- 5-3.org | 4 ++++ 5-4.org | 22 ++++++++++++++++++++++ 2 files changed, 26 insertions(+) create mode 100644 5-3.org create mode 100644 5-4.org diff --git a/5-3.org b/5-3.org new file mode 100644 index 0000000..6d49829 --- /dev/null +++ b/5-3.org @@ -0,0 +1,4 @@ +#+TITLE: 5.3 - Storage Allocation and Garbage Collection +#+STARTUP: indent +#+OPTIONS: num:nil +#+PROPERTY: header-args:scheme :tangle yes diff --git a/5-4.org b/5-4.org new file mode 100644 index 0000000..e04bca1 --- /dev/null +++ b/5-4.org @@ -0,0 +1,22 @@ +#+TITLE: 5.4 - The Explicit-Control Evaluator +#+STARTUP: indent +#+OPTIONS: num:nil +#+PROPERTY: header-args:scheme :tangle yes + +#+BEGIN_QUOTE +With the implementation of the explicit-control evaluator we come to +the end of a development, begun in Chapter 1, in which we have +explored successively more precise models of the evaluation +process. We started with the relatively informal substitution model, +then extended this in Chapter 3 to the environment model, which +enabled us to deal with state and change. In the metacircular +evaluator of Chapter 4, we used Scheme itself as a language for making +more explicit the environment structure constructed during evaluation +of an expression. Now, with register machines, we have taken a close +look at the evaluator’s mechanisms for storage management, argument +passing, and control. At each new level of description, we have had to +raise issues and resolve ambiguities that were not apparent at the +previous, less precise treatment of evaluation. To understand the +behavior of the explicit-control evaluator, we can simulate it and +monitor its performance. +#+END_QUOTE