Pages that link to "Item:Q3649133"
From MaRDI portal
The following pages link to From Reduction-Based to Reduction-Free Normalization (Q3649133):
Displaying 10 items.
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
- On graph rewriting, reduction, and evaluation in the presence of cycles (Q526460) (← links)
- A correspondence between type checking via reduction and type checking via evaluation (Q763480) (← links)
- Inter-deriving semantic artifacts for object-oriented programming (Q980939) (← links)
- A functional approach to generic programming using adaptive traversals (Q1929347) (← links)
- Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
- From Outermost Reduction Semantics to Abstract Machine (Q3453649) (← links)
- Generating Specialized Interpreters for Modular Structural Operational Semantics (Q3453654) (← links)
- Isomorphic Interpreters from Logically Reversible Abstract Machines (Q3453735) (← links)
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus (Q4972064) (← links)
