PLT Redex

Semantics engineering with PLT Redex. 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 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 url{}.

References in zbMATH (referenced in 23 articles )

Showing results 1 to 20 of 23.
Sorted by year (citations)

1 2 next

  1. Mourad, Benjamin; Cimini, Matteo: A calculus for language transformations (2020)
  2. Ştefănescu, Andrei; Ciobâcă, Stefan; Mereuta, Radu; Moore, Brandon; Roşu, Grigore; Şerbănuṭă, Traian Florin: All-path reachability logic (2019)
  3. van Binsbergen, L. Thomas; Mosses, Peter D.; Sculthorpe, Neil: Executable component-based semantics (2019)
  4. Biernacka, Małgorzata; Charatonik, Witold; Zielińska, Klara: Generalized refocusing: from hybrid strategies to abstract machines (2017)
  5. Cheney, James; Momigliano, Alberto: (\alpha\mathrmCheck): a mechanized metatheory model checker (2017)
  6. Gibbons, Jeremy: Aplicative programming with Naperian functors (2017)
  7. New, Max S.; Fetscher, Burke; Findler, Robert Bruce; McCarthy, Jay: Fair enumeration combinators (2017)
  8. Bettini, Lorenzo: Implementing type systems for the IDE with Xsemantics (2016)
  9. Capriccioli, Andrea; Servetto, Marco; Zucca, Elena: An imperative pure calculus (2016)
  10. Stump, Aaron; Fu, Peng: Efficiency of lambda-encodings in total type theory (2016)
  11. Danvy, Olivier; Johannsen, Jacob: From outermost reduction semantics to abstract machine (2014)
  12. Kuper, Lindsey; Turon, Aaron; Krishnaswami, Neelakantan R.; Newton, Ryan R.: Freeze after writing, quasi-deterministic parallel programming with LVars (2014)
  13. Van Cutsem, Tom; Gonzalez Boix, Elisa; Scholliers, Christophe; Lombide Carreton, Andoni; Harnie, Dries; Pinte, Kevin; De Meuter, Wolfgang: Ambienttalk: programming responsive mobile peer-to-peer applications with actors (2014) ioport
  14. St-Amour, Vincent; Toronto, Neil: Experience report: applying random testing to a base type environment (2013) ioport
  15. Zerny, Ian: On graph rewriting, reduction, and evaluation in the presence of cycles (2013)
  16. Chang, Stephen; Barzilay, Eli; Clements, John; Felleisen, Matthias: From stack traces to lazy rewriting sequences (2012)
  17. Flatt, Matthew; Culpepper, Ryan; Darais, David; Findler, Robert Bruce: Macros that work together (2012)
  18. Myreen, Magnus O.; Owens, Scott: Proof-producing synthesis of ML from higher-order logic (2012)
  19. Roşu, Grigore; Ştefănescu, Andrei: Towards a unified theory of operational and axiomatic semantics (2012)
  20. Van Horn, David; Might, Matthew: Systematic abstraction of abstract machines (2012)

1 2 next