Pages that link to "Item:Q2390256"
From MaRDI portal
The following pages link to A functional correspondence between call-by-need evaluators and lazy abstract machines (Q2390256):
Displaying 19 items.
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
- A syntactic correspondence between context-sensitive calculi and abstract machines (Q879356) (← links)
- Refunctionalization at work (Q923881) (← links)
- Inter-deriving semantic artifacts for object-oriented programming (Q980939) (← links)
- Improving the lazy Krivine machine (Q2464718) (← 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)
- Proofs, Upside Down (Q2937799) (← links)
- Calculating Certified Compilers for Non-deterministic Languages (Q2941174) (← links)
- Systematic abstraction of abstract machines (Q3165529) (← links)
- Cutting Out Continuations (Q3188285) (← links)
- Inter-deriving Semantic Artifacts for Object-Oriented Programming (Q3511441) (← links)
- From Reduction-Based to Reduction-Free Normalization (Q3649133) (← links)
- (Q5089007) (← links)
- (Q5111306) (← links)
- Calculating correct compilers (Q5371953) (← links)
- Normalization by evaluation for modal dependent type theory (Q6065506) (← links)
- Programming language semantics: It’s easy as 1,2,3 (Q6065508) (← links)
- Automating the functional correspondence between higher-order evaluators and abstract machines (Q6102250) (← links)