Pages that link to "Item:Q3625516"

The following pages link to Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine (Q3625516):

Displaying 22 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 verified framework for higher-order uncurrying optimizations (Q968367) (← links)
• A type system for the push-enter model (Q1014422) (← links)
• Proving correctness of a compiler using step-indexed logical relations (Q1744423) (← links)
• Explaining the lazy Krivine machine using explicit substitution and addresses (Q2464715) (← links)
• Improving the lazy Krivine machine (Q2464718) (← links)
• The next 700 Krivine machines (Q2464721) (← links)
• State-transition machines, revisited (Q2464722) (← links)
• Specialisation of Higher-Order Functions for Debugging (Q2841302) (← links)
• Structure and Properties of Traces for Functional Programs (Q2867898) (← links)
• NixOS: A purely functional Linux distribution (Q3021413) (← links)
• π-RED⁺ An interactive compiling graph reduction system for an applied λ-calculus (Q3125230) (← links)
• Abstract λ-Calculus Machines (Q3599179) (← links)
• The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving (Q4645809) (← links)
• Compiling laziness using projections (Q5030197) (← links)
• (Q5089007) (← links)
• Is the Optimal Implementation Inefficient? Elementarily Not (Q5111313) (← links)
• From natural semantics to C: A formal derivation of two STG machines (Q5302645) (← links)
• Modular, higher order cardinality analysis in theory and practice (Q5372006) (← links)
• Formal verifications of call-by-need and call-by-name evaluations with mutual recursion (Q6536314) (← links)
• Optimizing term rewriting with creeper trace transducers (Q6615561) (← links)