Cited in
(43)- Proof-producing synthesis of ML from higher-order logic
- Executable component-based semantics
- APLicative Programming with Naperian Functors
- A lazy desugaring system for evaluating programs with sugars
- From outermost reduction semantics to abstract machine
- Semantics engineering with PLT Redex
- An imperative pure calculus
- Towards a unified theory of operational and axiomatic semantics
- Implementing type systems for the IDE with Xsemantics
- MikiBeta : A General GUI Library for Visualizing Proof Trees
- A calculus for language transformations
- HYBRID
- Ott
- DACTL
- IC2D
- CIRC
- MontiCore
- LIME
- K tool
- MikiBeta
- Lua
- Spoofax
- Fair enumeration combinators
- Racket
- Lincx
- Celf
- Rover
- J
- Hackage
- K Prover
- Ruler
- αCheck: A mechanized metatheory model checker
- Systematic abstraction of abstract machines
- Efficiency of lambda-encodings in total type theory
- From specification to testing: semantics engineering for Lua 5.2
- Freeze after writing, quasi-deterministic parallel programming with LVars
- scientific article; zbMATH DE number 7204429 (Why is no real title available?)
- Lightroom
- On graph rewriting, reduction, and evaluation in the presence of cycles
- Correct blame for contracts, no more scapegoating
- Macros that work together
- Melange
- From Stack Traces to Lazy Rewriting Sequences
This page was built for software: PLT Redex
