The following pages link to Graham Hutton (Q1603475):
Displaying 28 items.
- The generic approximation lemma (Q1603477) (← links)
- Worker/wrapper/makes it/faster (Q2819669) (← links)
- Work it, wrap it, fix it, fold it (Q2875226) (← links)
- Factorising folds for faster functions (Q3070772) (← links)
- Cutting Out Continuations (Q3188285) (← links)
- The worker/wrapper transformation (Q3616448) (← links)
- Accurate Step Counting (Q3623952) (← links)
- Monadic parsing in Haskell (Q4236886) (← links)
- Compiling a 50-year journey (Q4625157) (← links)
- Programs for Cheap! (Q4635797) (← links)
- The countdown problem (Q4709845) (← links)
- Higher-order functions for parsing (Q4764615) (← links)
- When is a function a fold or an unfold? (Q4917036) (← links)
- A tutorial on the universality and expressiveness of fold (Q4943357) (← links)
- Modularity and Implementation of Mathematical Operational Semantics (Q5166622) (← links)
- Fold and unfold for program semantics (Q5234276) (← links)
- Mathematics of Program Construction (Q5313087) (← links)
- Fold and unfold for program semantics (Q5348904) (← links)
- Calculating correct compilers (Q5371953) (← links)
- What is the meaning of these constant interruptions? (Q5428373) (← links)
- (Q5472879) (← links)
- Programming in Haskell (Q5890833) (← links)
- Programming in Haskell (Q5899343) (← links)
- Improving Haskell (Q6062479) (← links)
- Programming language semantics: It’s easy as 1,2,3 (Q6065508) (← links)
- PhD Abstracts (Q6099201) (← links)
- PhD Abstracts (Q6113489) (← links)
- PhD Abstracts (Q6131904) (← links)