Muutke küpsiste eelistusi

Semantics Engineering with PLT Redex [Kõva köide]

(Northeastern University), (Northwestern University),
  • Formaat: Hardback, 520 pages, kõrgus x laius x paksus: 229x178x29 mm, kaal: 930 g, 36 figures; 36 Illustrations
  • Sari: The MIT Press
  • Ilmumisaeg: 10-Jul-2009
  • Kirjastus: MIT Press
  • ISBN-10: 0262062755
  • ISBN-13: 9780262062756
Teised raamatud teemal:
  • Formaat: Hardback, 520 pages, kõrgus x laius x paksus: 229x178x29 mm, kaal: 930 g, 36 figures; 36 Illustrations
  • Sari: The MIT Press
  • Ilmumisaeg: 10-Jul-2009
  • Kirjastus: MIT Press
  • ISBN-10: 0262062755
  • ISBN-13: 9780262062756
Teised raamatud teemal:
The first comprehensive presentation of reduction semantics in one volume, and the first tool set for such forms of semantics.

This text is the first comprehensive presentation of reduction semantics in one volume; it also introduces the first reliable and easy-to-use tool set for such forms of semantics. Software engineers have long known that automatic tool support is critical for rapid prototyping and modeling, and this book is addressed to the working semantics engineer (graduate student or professional language designer). The book comes with a prototyping tool suite to develop, explore, test, debug, and publish semantic models of programming languages. With PLT Redex, semanticists can formulate models as grammars and reduction models on their computers with the ease of paper and pencil.

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.

For more information (including the preface, a sample syllabus, and a quick introduction to Redex), see the Redex website at http://redex.plt-scheme.org/.

Matthias Felleisen, Robert Bruce Findler, and Matthew Flatt are the authors (with Shiram Krishnamurthi) of How to Design Programs: An Introduction to Programming and Computing, also published by the MIT Press.
Preface ix
Reduction Semantics
1(4)
Semantics via Syntax
5(8)
Analyzing Syntactic Semantics
13(10)
The λ-Calculus
23(22)
ISWIM
45(20)
An Abstract Syntax Machine
65(24)
Abstract Register Machines
89(18)
Tail Calls and More Space Savings
107(8)
Control: Errors, Exceptions, and Continuations
115(30)
State: Imperative Assignment
145(30)
Simply Typed ISWIM
175(26)
PLT Redex
201(4)
The Basics
205(12)
Variables and Meta-functions
217(10)
Layered Development
227(10)
Testing
237(8)
Debugging
245(62)
Order of Evaluation
259(18)
Continuations as Values
271(6)
Typesetting
277(20)
A Tour of DrScheme
297(10)
Applications
307(4)
Modular ACL2
311(16)
Carl Eastlund
Modeling Scheme Macros
327(30)
Martin Gasbichler
A Model of Java/Scheme Interoperability
357(24)
Kathryn E. Gray
Implementing Hidden Type Variables in Fortress
381(22)
Joe Hallett
Eric Allen
Sukyoung Ryu
Type Checking and Inference via Reductions
403(26)
George Kuan
Topsl: DSEL as Multi-language System
429(30)
Jacob Matthews
Prototyping Nested Schedulers
459(26)
Mike Rainey
Bibliography 485(10)
Index 495