PLT Redex
From MaRDI portal
Software:21900
swMATH9921MaRDI QIDQ21900FDOQ21900
Author name not available (Why is that?)
Cited In (23)
- Title not available (Why is that?)
- APLicative Programming with Naperian Functors
- From specification to testing: semantics engineering for Lua 5.2
- Executable component-based semantics
- Fair enumeration combinators
- Semantics engineering with PLT Redex
- Systematic abstraction of abstract machines
- An imperative pure calculus
- Implementing type systems for the IDE with Xsemantics
- From Outermost Reduction Semantics to Abstract Machine
- Proof-producing synthesis of ML from higher-order logic
- A lazy desugaring system for evaluating programs with sugars
- Towards a Unified Theory of Operational and Axiomatic Semantics
- αCheck: A mechanized metatheory model checker
- From Stack Traces to Lazy Rewriting Sequences
- Correct blame for contracts
- Macros that work together
- A Calculus for Language Transformations
- MikiBeta : A General GUI Library for Visualizing Proof Trees
- All-Path Reachability Logic
- Efficiency of lambda-encodings in total type theory
- Freeze after writing
- On graph rewriting, reduction, and evaluation in the presence of cycles
This page was built for software: PLT Redex
