The following pages link to Olivier Danvy (Q232933):
Displayed 50 items.
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
- On obtaining the Boyer-Moore string-matching algorithm by partial evaluation (Q845710) (← links)
- Peter J. Landin (1930--2009) (Q848746) (← 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)
- CPS transformation of beta-redexes (Q1041755) (← links)
- On the dynamic extent of delimited continuations (Q1044694) (← links)
- Automatic autoprojection of recursive equations with global variables and abstract data types (Q1183547) (← links)
- Back to direct style (Q1330432) (← links)
- (Q1583364) (redirect page) (← links)
- Lambda-dropping: Transforming recursive equations into programs with block structure (Q1583366) (← links)
- A first-order one-pass CPS transformation (Q1884883) (← links)
- A characterization of Moessner's sieve (Q2253190) (← links)
- A functional correspondence between call-by-need evaluators and lazy abstract machines (Q2390256) (← links)
- On the static and dynamic extents of delimited continuations (Q2495550) (← links)
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (Q2566031) (← links)
- (Q2752057) (← links)
- (Q2763631) (← links)
- (Q2763648) (← links)
- (Q2766784) (← links)
- (Q2778811) (← links)
- Syntactic Theories in Practice (Q2841251) (← links)
- (Q2849585) (← links)
- (Q2852349) (← links)
- Syntactic accidents in program analysis (Q2943371) (← links)
- Three syntactic theories for combinatory graph reduction (Q2946718) (← links)
- Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
- Normalization by evaluation with typed abstract syntax (Q3150210) (← links)
- (Q3372478) (← links)
- From Outermost Reduction Semantics to Abstract Machine (Q3453649) (← links)
- Inter-deriving Semantic Artifacts for Object-Oriented Programming (Q3511441) (← links)
- Defunctionalized Interpreters for Call-by-Need Evaluation (Q3558342) (← links)
- A Rational Deconstruction of Landin's SECD Machine with the J Operator (Q3623008) (← links)
- A Rational Deconstruction of Landin’s J Operator (Q3623949) (← links)
- From Reduction-Based to Reduction-Free Normalization (Q3649133) (← links)
- Functional unparsing (Q4240154) (← links)
- Representing Control: a Study of the CPS Transformation (Q4279251) (← links)
- Thunks and the λ-calculus (Q4358459) (← links)
- A computational formalization for partial evaluation (Q4366769) (← links)
- (Q4409156) (← links)
- (Q4414735) (← links)
- (Q4414737) (← links)
- (Q4417784) (← links)
- (Q4417903) (← links)
- (Q4440321) (← links)
- (Q4445769) (← links)
- (Q4445770) (← links)
- Syntactic accidents in program analysis: on the impact of the CPS transformation (Q4460718) (← links)