The following pages link to (Q3655271):
Displaying 23 items.
- On graph rewriting, reduction, and evaluation in the presence of cycles (Q526460) (← links)
- An imperative pure calculus (Q737089) (← links)
- Implementing type systems for the IDE with Xsemantics (Q739624) (← links)
- A correspondence between type checking via reduction and type checking via evaluation (Q763480) (← links)
- A content semantics for quantified relevant logics. II (Q910392) (← links)
- Executable component-based semantics (Q1734523) (← links)
- System description: lang-n-change -- a tool for transforming languages (Q2039949) (← links)
- From specification to testing: semantics engineering for Lua 5.2 (Q2102942) (← links)
- A lazy desugaring system for evaluating programs with sugars (Q2163178) (← links)
- Macros that work together (Q2844698) (← links)
- APLicative Programming with Naperian Functors (Q2988659) (← links)
- MikiBeta : A General GUI Library for Visualizing Proof Trees (Q3003488) (← links)
- Lazy tree splitting (Q3165522) (← links)
- Systematic abstraction of abstract machines (Q3165529) (← links)
- A Calculus for Language Transformations (Q3297783) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- Fair enumeration combinators (Q4625156) (← links)
- (Q5089007) (← links)
- (Q5111306) (← links)
- All-Path Reachability Logic (Q5170834) (← links)
- Efficiency of lambda-encodings in total type theory (Q5371961) (← links)
- Automating the functional correspondence between higher-order evaluators and abstract machines (Q6102250) (← links)
- Towards substructural property-based testing (Q6102253) (← links)
