Pages that link to "Item:Q879356"
From MaRDI portal
The following pages link to A syntactic correspondence between context-sensitive calculi and abstract machines (Q879356):
Displaying 19 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)
- An abstract framework for environment machines (Q804281) (← links)
- A syntactic correspondence between context-sensitive calculi and abstract machines (Q879356) (← links)
- Refunctionalization at work (Q923881) (← links)
- On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion (Q963342) (← links)
- Inter-deriving semantic artifacts for object-oriented programming (Q980939) (← links)
- A functional correspondence between call-by-need evaluators and lazy abstract machines (Q2390256) (← links)
- A call-by-name lambda-calculus machine (Q2464723) (← links)
- A static simulation of dynamic delimited control (Q2464731) (← links)
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (Q2566031) (← links)
- A context-based approach to proving termination of evaluation (Q2805157) (← links)
- From Outermost Reduction Semantics to Abstract Machine (Q3453649) (← links)
- Inter-deriving Semantic Artifacts for Object-Oriented Programming (Q3511441) (← links)
- From Reduction-Based to Reduction-Free Normalization (Q3649133) (← links)
- (Q5089007) (← links)
- (Q5111306) (← links)
- On one-pass CPS transformations (Q5428374) (← links)
- Automating the functional correspondence between higher-order evaluators and abstract machines (Q6102250) (← links)
