PLT Redex
From MaRDI portal
Software:21900
swMATH9921MaRDI QIDQ21900FDOQ21900
Author name not available (Why is that?)
Cited In (22)
- 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
- From outermost reduction semantics to abstract machine
- Freeze after writing, quasi-deterministic parallel programming with LVars
- Fair enumeration combinators
- Semantics engineering with PLT Redex
- Systematic abstraction of abstract machines
- Towards a unified theory of operational and axiomatic semantics
- An imperative pure calculus
- Implementing type systems for the IDE with Xsemantics
- A calculus for language transformations
- Proof-producing synthesis of ML from higher-order logic
- A lazy desugaring system for evaluating programs with sugars
- αCheck: A mechanized metatheory model checker
- From Stack Traces to Lazy Rewriting Sequences
- Macros that work together
- MikiBeta : A General GUI Library for Visualizing Proof Trees
- Efficiency of lambda-encodings in total type theory
- On graph rewriting, reduction, and evaluation in the presence of cycles
- Correct blame for contracts, no more scapegoating
This page was built for software: PLT Redex
