Pages that link to "Item:Q2566031"

The following pages link to A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (Q2566031):

Displaying 15 items.

• A correspondence between type checking via reduction and type checking via evaluation (Q763480) (← 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)
• Explaining the lazy Krivine machine using explicit substitution and addresses (Q2464715) (← links)
• Improving the lazy Krivine machine (Q2464718) (← links)
• A static simulation of dynamic delimited control (Q2464731) (← links)
• Combining effects: sum and tensor (Q2500483) (← links)
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (Q2566031) (← 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)
• New Developments in Environment Machines (Q5170161) (← links)