Semantics engineering with PLT Redex
Felleisen, Matthias
Semantics engineering with PLT Redex Matthias Felleisen; Robert Bruce Findler; Matthew Flatt - New Delhi: PHI Learning, 2011. - xii, 502 pages : illustrations ; 24 cm
Reduction semantics --
Semantics via syntax --
Analyzing syntactic semantics --
The [lambda]-calculus --
ISWIM --
An abstract syntax machine --
Abstract register machines --
Tail calls and more space savings --
Control : errors, exceptions, and continuations --
State : imperative assignment --
Simply typed ISWIM --
PLT redex --
The basics --
Variables and meta-functions --
Layered development --
Testing --
Debugging --
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. 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 computer 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, and then introduces PLT Redex, a suite of software tools for expressing these models as PLT Redex models.
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.
This book is useful for the working semantics engineer (graduate student or professional language designer).
9788120343207
Programming languages (Electronic computers)--Semantics
Domain-specific programming languages
Redex (Computer program language)
005.11 / FEL
Semantics engineering with PLT Redex Matthias Felleisen; Robert Bruce Findler; Matthew Flatt - New Delhi: PHI Learning, 2011. - xii, 502 pages : illustrations ; 24 cm
Reduction semantics --
Semantics via syntax --
Analyzing syntactic semantics --
The [lambda]-calculus --
ISWIM --
An abstract syntax machine --
Abstract register machines --
Tail calls and more space savings --
Control : errors, exceptions, and continuations --
State : imperative assignment --
Simply typed ISWIM --
PLT redex --
The basics --
Variables and meta-functions --
Layered development --
Testing --
Debugging --
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. 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 computer 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, and then introduces PLT Redex, a suite of software tools for expressing these models as PLT Redex models.
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.
This book is useful for the working semantics engineer (graduate student or professional language designer).
9788120343207
Programming languages (Electronic computers)--Semantics
Domain-specific programming languages
Redex (Computer program language)
005.11 / FEL