Semantics engineering with PLT Redex
From MaRDI portal
Publication:3655271
Recommendations
Cited in
(23)- scientific article; zbMATH DE number 7204429 (Why is no real title available?)
- APLicative Programming with Naperian Functors
- From specification to testing: semantics engineering for Lua 5.2
- Executable component-based semantics
- Lem: reusable engineering of real-world semantics
- Fair enumeration combinators
- Systematic abstraction of abstract machines
- Automating the functional correspondence between higher-order evaluators and abstract machines
- An imperative pure calculus
- Implementing type systems for the IDE with Xsemantics
- A calculus for language transformations
- Deriving an abstract machine for strong call by need
- 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
- A content semantics for quantified relevant logics. II
- Lazy tree splitting
- 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
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)