The text first presents a framework for the formulation of language models, focusing on equational calculi and abstract machines, then introduces PLT Redex, a suite of software tools for expressing these models as PLT Redex models. Finally, experts describe a range of models formulated in Redex. PLT Redex comes with the PLT Scheme implementation, available free at http://www.plt-scheme.org/. Readers can download the software and experiment with Redex as they work their way through the book.

I Reduction Semantics

1 Semantics via Syntax

2 Analyzing syntactic Semantics

3 The λ Calculus

4 ISWIM

5 An Abstract Syntax Machine

6 Abstract Register Machine

7 Tail Calls and More Space Savings

8 Control:Error,Exceptions,and Continuations

9 State: Imperative Assignment

10 Simply Typed ISWIM

II PLT Redex

11 The Basic

12 Variable and Meta-functions

13 Layered Development

14 Testing

15 Debugging

16 Case study 1: Order of Evaluation

17 Case study 2: Continuations as Value

18 Typesetting

A Appendix: A Tour of DrScheme

III Applications

19 Modular

20 Modeling Scheme Macros

21 A Model of Java/Scheme Interoperability

22 Implementing Hidden Type Variables in Fortress

23 Type Checking and Inference via Reductions

24 Topsl: DSEL as Multi-Language System

25 Prototyping Nested Schedulers

Bibliography

Index