Semantics engineering with PLT Redex
From MaRDI portal
Publication:3655271
zbMATH Open1183.68359MaRDI QIDQ3655271FDOQ3655271
Authors: Matthias Felleisen, Bruce Findler, Matthew Flatt 
Publication date: 7 January 2010
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Semantics in the theory of computing (68Q55)
Cited In (23)
- Title not available (Why is that?)
- APLicative Programming with Naperian Functors
- Title not available (Why is that?)
- From specification to testing: semantics engineering for Lua 5.2
- Executable component-based semantics
- Lem: reusable engineering of real-world semantics
- Fair enumeration combinators
- Automating the functional correspondence between higher-order evaluators and abstract machines
- Systematic abstraction of abstract machines
- An imperative pure calculus
- Implementing type systems for the IDE with Xsemantics
- A calculus for language transformations
- A lazy desugaring system for evaluating programs with sugars
- A correspondence between type checking via reduction and type checking via evaluation
- αCheck: A mechanized metatheory model checker
- Lazy tree splitting
- A content semantics for quantified relevant logics. II
- Macros that work together
- MikiBeta : A General GUI Library for Visualizing Proof Trees
- Towards substructural property-based testing
- Efficiency of lambda-encodings in total type theory
- System description: lang-n-change -- a tool for transforming languages
- On graph rewriting, reduction, and evaluation in the presence of cycles
Uses Software
This page was built for publication: Semantics engineering with PLT Redex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655271)
