reduction strategies for cbn and cbv
play

Reduction strategies for CBN and CBV Structural operational style - PowerPoint PPT Presentation

Jul 27, 2023 •124 likes •1.27k views

Reduction strategies for CBN and CBV Structural operational style and Felleisen style Bas Broere April 24th 2018 Bas Broere Reduction strategies for CBN and CBV 1/22 Introduction Disclaimer I have (almost) no experience in functional

  1. Features/limitations of SOS in CBV We cannot reduce under λ -abstractions (weak reduction). So this is NOT a thing: M → M ′ λ x . M → λ x . M ′ Bas Broere — Reduction strategies for CBN and CBV 9/22

  2. Features/limitations of SOS in CBV We cannot reduce under λ -abstractions (weak reduction). So this is NOT a thing: M → M ′ λ x . M → λ x . M ′ We need to reduce N to a value if we want to evaluate ( λ x . M ) N (call-by-value). So also this is NOT a thing: ( λ x . M )( N P ) → M [ x := N P ] Bas Broere — Reduction strategies for CBN and CBV 9/22

  3. Features/limitations of SOS in CBV We cannot reduce under λ -abstractions (weak reduction). So this is NOT a thing: M → M ′ λ x . M → λ x . M ′ We need to reduce N to a value if we want to evaluate ( λ x . M ) N (call-by-value). So also this is NOT a thing: ( λ x . M )( N P ) → M [ x := N P ] In the application M N , we need to reduce M to a value first (left-to-right), because: N → N ′ v N → v N ′ (app-r) . Bas Broere — Reduction strategies for CBN and CBV 9/22

  4. Features/limitations of SOS in CBV We cannot reduce under λ -abstractions (weak reduction). So this is NOT a thing: M → M ′ λ x . M → λ x . M ′ We need to reduce N to a value if we want to evaluate ( λ x . M ) N (call-by-value). So also this is NOT a thing: ( λ x . M )( N P ) → M [ x := N P ] In the application M N , we need to reduce M to a value first (left-to-right), because: N → N ′ v N → v N ′ (app-r) . It is deterministic, i.e. for every M there is at most one M ′ s.t. M → M ′ . Bas Broere — Reduction strategies for CBN and CBV 9/22

  5. Multiple reductions When making a reduction sequence we have 3 possibilities: Bas Broere — Reduction strategies for CBN and CBV 10/22

  6. Multiple reductions When making a reduction sequence we have 3 possibilities: 1 The reductions end in a value (termination): M → M 1 → M 2 → . . . → v . Example: ( λ x .λ y . y x ) (( λ x . x )1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) → ( λ y . y 1) ( λ x . x ) → ( λ x . x ) 1 → 1 Bas Broere — Reduction strategies for CBN and CBV 10/22

  7. Multiple reductions When making a reduction sequence we have 3 possibilities: 1 The reductions end in a value (termination): M → M 1 → M 2 → . . . → v . Example: ( λ x .λ y . y x ) (( λ x . x )1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) → ( λ y . y 1) ( λ x . x ) → ( λ x . x ) 1 → 1 2 The reduction never ends (divergence): M → M 1 → M 2 → . . . → M n → . . . . Example: Bas Broere — Reduction strategies for CBN and CBV 10/22

  8. Multiple reductions When making a reduction sequence we have 3 possibilities: 1 The reductions end in a value (termination): M → M 1 → M 2 → . . . → v . Example: ( λ x .λ y . y x ) (( λ x . x )1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) → ( λ y . y 1) ( λ x . x ) → ( λ x . x ) 1 → 1 2 The reduction never ends (divergence): M → M 1 → M 2 → . . . → M n → . . . . Example: ω ω , where ω = λ x . x x . Bas Broere — Reduction strategies for CBN and CBV 10/22

  9. Multiple reductions When making a reduction sequence we have 3 possibilities: 1 The reductions end in a value (termination): M → M 1 → M 2 → . . . → v . Example: ( λ x .λ y . y x ) (( λ x . x )1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) → ( λ y . y 1) ( λ x . x ) → ( λ x . x ) 1 → 1 2 The reduction never ends (divergence): M → M 1 → M 2 → . . . → M n → . . . . Example: ω ω , where ω = λ x . x x . 3 Error: M → M 1 → M 2 → . . . → M n �→ , where M n is not a value, but also does not reduce. Example: Bas Broere — Reduction strategies for CBN and CBV 10/22

  10. Multiple reductions When making a reduction sequence we have 3 possibilities: 1 The reductions end in a value (termination): M → M 1 → M 2 → . . . → v . Example: ( λ x .λ y . y x ) (( λ x . x )1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) → ( λ y . y 1) ( λ x . x ) → ( λ x . x ) 1 → 1 2 The reduction never ends (divergence): M → M 1 → M 2 → . . . → M n → . . . . Example: ω ω , where ω = λ x . x x . 3 Error: M → M 1 → M 2 → . . . → M n �→ , where M n is not a value, but also does not reduce. Example: ω 2 → 2 2 �→ . Bas Broere — Reduction strategies for CBN and CBV 10/22

  11. Reduction strategies for CBV Reduction contexts (felleisen style) Head reductions: ( λ x . M ) v → ǫ M [ x := v ] ( β v ) Bas Broere — Reduction strategies for CBN and CBV 11/22

  12. Reduction strategies for CBV Reduction contexts (felleisen style) Head reductions: ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , with E ::= [ ] | E b | v E terms with a hole [ ] in it. Bas Broere — Reduction strategies for CBN and CBV 11/22

  13. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 12/22

  14. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 12/22

  15. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 12/22

  16. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 12/22

  17. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 12/22

  18. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) E = [ ] ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 12/22

  19. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) E = [ ] ( λ x . x ) → ( λ y . y 1) ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 12/22

  20. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) E = [ ] ( λ x . x ) → ( λ y . y 1) ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 12/22

  21. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) E = [ ] ( λ x . x ) → ( λ y . y 1) ( λ x . x ) E = [ ] Bas Broere — Reduction strategies for CBN and CBV 12/22

  22. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) E = [ ] ( λ x . x ) → ( λ y . y 1) ( λ x . x ) E = [ ] → ( λ x . x ) 1 Bas Broere — Reduction strategies for CBN and CBV 12/22

  23. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) E = [ ] ( λ x . x ) → ( λ y . y 1) ( λ x . x ) E = [ ] → ( λ x . x ) 1 E = [ ] Bas Broere — Reduction strategies for CBN and CBV 12/22

  24. Example Reduction contexts (Felleisen style) ( λ x . M ) v → ǫ M [ x := v ] ( β v ) M → ǫ M ′ E [ M ] → E [ M ′ ] (context) , E ::= [ ] | E b | v E Same example as before: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) E = ( λ x .λ y . x y ) [ ] ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) E = [ ] ( λ x . x ) → ( λ y . y 1) ( λ x . x ) E = [ ] → ( λ x . x ) 1 E = [ ] → 1 Bas Broere — Reduction strategies for CBN and CBV 12/22

  25. Equivalence SOS and Felleisen Remember the earlier example: ( λ x . x ) 1 → 1 ( λ x .λ y . y x ) (( λ x . x ) 1) → ( λ x .λ y . y x ) 1 ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) This corresponds to the context: Bas Broere — Reduction strategies for CBN and CBV 13/22

  26. Equivalence SOS and Felleisen Remember the earlier example: ( λ x . x ) 1 → 1 ( λ x .λ y . y x ) (( λ x . x ) 1) → ( λ x .λ y . y x ) 1 ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) This corresponds to the context: E = Bas Broere — Reduction strategies for CBN and CBV 13/22

  27. Equivalence SOS and Felleisen Remember the earlier example: ( λ x . x ) 1 → 1 ( λ x .λ y . y x ) (( λ x . x ) 1) → ( λ x .λ y . y x ) 1 ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) This corresponds to the context: E = (( λ x .λ y . y x ) [ ]) ( λ x . x ) with head reduction ( λ x . x ) 1 → ǫ 1. Bas Broere — Reduction strategies for CBN and CBV 13/22

  28. Equivalence SOS and Felleisen Remember the earlier example: ( λ x . x ) 1 → 1 ( λ x .λ y . y x ) (( λ x . x ) 1) → ( λ x .λ y . y x ) 1 ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ x . x ) → ( λ x .λ y . y x ) 1 ( λ x . x ) This corresponds to the context: E = (( λ x .λ y . y x ) [ ]) ( λ x . x ) with head reduction ( λ x . x ) 1 → ǫ 1. Equivalence SOS and Felleisen approach are one-to-one! Bas Broere — Reduction strategies for CBN and CBV 13/22

  29. Result From this equivalence, it follow that Felleisen style also has the previously discussed properties: Left-to-right, Call-by-value, Weak reduction, Deterministic*. Bas Broere — Reduction strategies for CBN and CBV 14/22

  30. Result From this equivalence, it follow that Felleisen style also has the previously discussed properties: Left-to-right, Call-by-value, Weak reduction, Deterministic*. *: The determinism is also a consequence of the following theorem: Unique decomposition theorem For all terms M , there exists at most one reduction context E and one term N , s.t. M = E [ N ] and N can reduce by head-reduction. Bas Broere — Reduction strategies for CBN and CBV 14/22

  31. Result From this equivalence, it follow that Felleisen style also has the previously discussed properties: Left-to-right, Call-by-value, Weak reduction, Deterministic*. *: The determinism is also a consequence of the following theorem: Unique decomposition theorem For all terms M , there exists at most one reduction context E and one term N , s.t. M = E [ N ] and N can reduce by head-reduction. Proof: Induction on the terms. Bas Broere — Reduction strategies for CBN and CBV 14/22

  32. Reduction strategies for CBN Call-by-name The arguments to a function are not evaluated before the function is called (perform β -reduction asap). Bas Broere — Reduction strategies for CBN and CBV 15/22

  33. Reduction strategies for CBN Call-by-name The arguments to a function are not evaluated before the function is called (perform β -reduction asap). Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) Bas Broere — Reduction strategies for CBN and CBV 15/22

  34. Reduction strategies for CBN Call-by-name The arguments to a function are not evaluated before the function is called (perform β -reduction asap). Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , with E ::= [ ] | E M Bas Broere — Reduction strategies for CBN and CBV 15/22

  35. Reduction strategies for CBN Call-by-name The arguments to a function are not evaluated before the function is called (perform β -reduction asap). Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , with E ::= [ ] | E M , so E ::= [ ] M 1 . . . M n . Bas Broere — Reduction strategies for CBN and CBV 15/22

  36. Examples Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) The same example once again, in SOS-style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) Bas Broere — Reduction strategies for CBN and CBV 16/22

  37. Examples Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) The same example once again, in SOS-style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) Bas Broere — Reduction strategies for CBN and CBV 16/22

  38. Examples Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) The same example once again, in SOS-style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) Bas Broere — Reduction strategies for CBN and CBV 16/22

  39. Examples Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) The same example once again, in SOS-style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) Bas Broere — Reduction strategies for CBN and CBV 16/22

  40. Examples Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) The same example once again, in SOS-style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) → ( λ z . z ) (( λ x . x ) 1) Bas Broere — Reduction strategies for CBN and CBV 16/22

  41. Examples Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) The same example once again, in SOS-style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) → ( λ z . z ) (( λ x . x ) 1) → ( λ x . x ) 1 Bas Broere — Reduction strategies for CBN and CBV 16/22

  42. Examples Structural operation style (SOS) M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) M N → M ′ N (app-l) The same example once again, in SOS-style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) → ( λ z . z ) (( λ x . x ) 1) → ( λ x . x ) 1 → 1 . Bas Broere — Reduction strategies for CBN and CBV 16/22

  43. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 17/22

  44. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ x . x ) Bas Broere — Reduction strategies for CBN and CBV 17/22

  45. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) Bas Broere — Reduction strategies for CBN and CBV 17/22

  46. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) Bas Broere — Reduction strategies for CBN and CBV 17/22

  47. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) Bas Broere — Reduction strategies for CBN and CBV 17/22

  48. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) E = [ ] Bas Broere — Reduction strategies for CBN and CBV 17/22

  49. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) E = [ ] → ( λ z . z ) (( λ x . x ) 1) Bas Broere — Reduction strategies for CBN and CBV 17/22

  50. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) E = [ ] → ( λ z . z ) (( λ x . x ) 1) E = [ ] Bas Broere — Reduction strategies for CBN and CBV 17/22

  51. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) E = [ ] → ( λ z . z ) (( λ x . x ) 1) E = [ ] → ( λ x . x ) 1 Bas Broere — Reduction strategies for CBN and CBV 17/22

  52. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) E = [ ] → ( λ z . z ) (( λ x . x ) 1) E = [ ] → ( λ x . x ) 1 E = [ ] Bas Broere — Reduction strategies for CBN and CBV 17/22

  53. Examples Felleisen style M → M ′ ( λ x . M ) N → M [ x := N ] ( β n ) E [ M ] → E [ M ′ ](context) , E ::= [ ] | E M . And in Felleisen style: ( λ x .λ y . y x ) (( λ x . x ) 1) ( λ z . z ) E = [ ] ( λ z . z ) → ( λ y . y (( λ x . x ) 1)) ( λ z . z ) E = [ ] → ( λ z . z ) (( λ x . x ) 1) E = [ ] → ( λ x . x ) 1 E = [ ] → 1 . Bas Broere — Reduction strategies for CBN and CBV 17/22

  54. CBV vs CBN Some examples: Termination: Bas Broere — Reduction strategies for CBN and CBV 18/22

  55. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → Bas Broere — Reduction strategies for CBN and CBV 18/22

  56. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; Bas Broere — Reduction strategies for CBN and CBV 18/22

  57. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; CBV: ( λ x . 1) ( ω ω ) → Bas Broere — Reduction strategies for CBN and CBV 18/22

  58. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; CBV: ( λ x . 1) ( ω ω ) → ( λ x . 1) ( ω ω ) → . . . Bas Broere — Reduction strategies for CBN and CBV 18/22

  59. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; CBV: ( λ x . 1) ( ω ω ) → ( λ x . 1) ( ω ω ) → . . . In general: Termination in CBV implies termination in CBN, but not the other way around. Bas Broere — Reduction strategies for CBN and CBV 18/22

  60. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; CBV: ( λ x . 1) ( ω ω ) → ( λ x . 1) ( ω ω ) → . . . In general: Termination in CBV implies termination in CBN, but not the other way around. Efficiency: Bas Broere — Reduction strategies for CBN and CBV 18/22

  61. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; CBV: ( λ x . 1) ( ω ω ) → ( λ x . 1) ( ω ω ) → . . . In general: Termination in CBV implies termination in CBN, but not the other way around. Efficiency: ( λ x . x + x ) M : Bas Broere — Reduction strategies for CBN and CBV 18/22

  62. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; CBV: ( λ x . 1) ( ω ω ) → ( λ x . 1) ( ω ω ) → . . . In general: Termination in CBV implies termination in CBN, but not the other way around. Efficiency: ( λ x . x + x ) M : CBV evaluates M once, CBN twice; Bas Broere — Reduction strategies for CBN and CBV 18/22

  63. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; CBV: ( λ x . 1) ( ω ω ) → ( λ x . 1) ( ω ω ) → . . . In general: Termination in CBV implies termination in CBN, but not the other way around. Efficiency: ( λ x . x + x ) M : CBV evaluates M once, CBN twice; ( λ x . 1) M : Bas Broere — Reduction strategies for CBN and CBV 18/22

  64. CBV vs CBN Some examples: Termination: CBN: ( λ x . 1) ( ω ω ) → 1; CBV: ( λ x . 1) ( ω ω ) → ( λ x . 1) ( ω ω ) → . . . In general: Termination in CBV implies termination in CBN, but not the other way around. Efficiency: ( λ x . x + x ) M : CBV evaluates M once, CBN twice; ( λ x . 1) M : CBV evaluates M once, CBN not at all. Bas Broere — Reduction strategies for CBN and CBV 18/22

  65. CBN in CBV language Bas Broere — Reduction strategies for CBN and CBV 19/22

  66. CBN in CBV language Introduce functions λ x . M to delay computation of M (thunks). Bas Broere — Reduction strategies for CBN and CBV 19/22

  67. CBN in CBV language Introduce functions λ x . M to delay computation of M (thunks). 1 � x � = x () (application); Bas Broere — Reduction strategies for CBN and CBV 19/22

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Planning and Optimization November 7, 2018 D8. M&S: Strategies and Label Reduction D8.1

Planning and Optimization November 7, 2018 D8. M&S: Strategies and Label Reduction D8.1

Planning and Optimization November 7, 2018 D8. M&S: Strategies and Label Reduction D8.1 Merging Strategies Planning and Optimization D8. M&S: Strategies and Label Reduction D8.2 Shrinking Strategies Gabriele R oger and Thomas

335 views • 12 slides
What is it: Harm reduction is a set of practical strategies and ideas aimed at reducing

What is it: Harm reduction is a set of practical strategies and ideas aimed at reducing

What is it: Harm reduction is a set of practical strategies and ideas aimed at reducing negative consequences associated with drug/alcohol use and accompanying behaviors. Harm reduction embodies the core value that human beings

537 views • 7 slides
Incorporating Harm Reduction Strategies in Behavioral Health Grantmaking October 25, 2017 1:00 p.m.

Incorporating Harm Reduction Strategies in Behavioral Health Grantmaking October 25, 2017 1:00 p.m.

Incorporating Harm Reduction Strategies in Behavioral Health Grantmaking October 25, 2017 1:00 p.m. Eastern Daniel Raymond , Harm Reduction Coalition Jamie Wood , Open Society Foundations Hol Holes in in the the Fa Fabric Overdose epidemic

371 views • 14 slides
6/7/2017 1 6/7/2017 Planning for I/I Reduction and Strategies to Get the Job Done June 7, 2017

6/7/2017 1 6/7/2017 Planning for I/I Reduction and Strategies to Get the Job Done June 7, 2017

6/7/2017 1 6/7/2017 Planning for I/I Reduction and Strategies to Get the Job Done June 7, 2017 1:00 3:00 pm Eastern How to Participate Today Audio Modes Listen using Mic & S peakers Or, select Use Telephone

742 views • 53 slides
Poverty, democratic governance and poverty reduction strategies Paul Spicker Robert Gordon

Poverty, democratic governance and poverty reduction strategies Paul Spicker Robert Gordon

Poverty, democratic governance and poverty reduction strategies Paul Spicker Robert Gordon University Aberdeen, Scotland Abstract. The Poverty Reduction Strategy Papers have become a significant experiment in world governance. Poverty is a

443 views • 20 slides
Deploying Simulation to Compare among Different Risk Reduction Strategies for Supply Chains

Deploying Simulation to Compare among Different Risk Reduction Strategies for Supply Chains

Deploying Simulation to Compare among Different Risk Reduction Strategies for Supply Chains Cameron MacKenzie, Defense Resources Management Institute, Naval Postgraduate School Japanese earthquake and tsunami 2 Previous research Global

665 views • 47 slides
CSE 505: Programming Languages Lecture 8 Reduction Strategies; Substitution Zach Tatlock

CSE 505: Programming Languages Lecture 8 Reduction Strategies; Substitution Zach Tatlock

CSE 505: Programming Languages Lecture 8 Reduction Strategies; Substitution Zach Tatlock Fall 2013 Review -calculus syntax: e ::= x. e | x | e e v ::= x. e Call-By-Value Left-To-Right Small-Step Operational Semantics: e e

397 views • 17 slides
Emission Reduction Strategies for the Electricity Sector and Their Impact Presentation to the

Emission Reduction Strategies for the Electricity Sector and Their Impact Presentation to the

Emission Reduction Strategies for the Electricity Sector and Their Impact Presentation to the EMEP Conference on Linking Science and Policy October 25-26, 2005 Albany, New York by Karen Palmer Multipollutant Policy in the Electricity

692 views • 19 slides
DESIGN AND PLANNING STRATEGIES FOR DISASTER RISK REDUCTION AND MITIGATION FOR INFRASTRUCTURE V

DESIGN AND PLANNING STRATEGIES FOR DISASTER RISK REDUCTION AND MITIGATION FOR INFRASTRUCTURE V

DESIGN AND PLANNING STRATEGIES FOR DISASTER RISK REDUCTION AND MITIGATION FOR INFRASTRUCTURE V Suresh Vice Chairman, National Building Code of India Former CMD, HUDCO Understanding Risk Forum 2016 16 th 20 th May 2016 Venice, Italy

177 views • 14 slides
Safer places Harm reduction strategies to address human trafficking Miigwetch We are grateful to

Safer places Harm reduction strategies to address human trafficking Miigwetch We are grateful to

Safer places Harm reduction strategies to address human trafficking Miigwetch We are grateful to those who stepped forward to share their journeys Owning our story can be hard but not nearly as difficult as spending our lives running

618 views • 36 slides
IV Interim Findings from the Multi-Sector Working Group Greenhouse Gas Reduction Strategies in

IV Interim Findings from the Multi-Sector Working Group Greenhouse Gas Reduction Strategies in

IV Interim Findings from the Multi-Sector Working Group Greenhouse Gas Reduction Strategies in the Metropolitan Washington Region Presentation to the Northern Virginia Transportation Authority September 24, 2015 Charge Given To Multi-Sector

304 views • 18 slides
Advancing Health Equity with Harm Reduction Strategies Cosponsored by Funders Concerned About AIDS

Advancing Health Equity with Harm Reduction Strategies Cosponsored by Funders Concerned About AIDS

Advancing Health Equity with Harm Reduction Strategies Cosponsored by Funders Concerned About AIDS October 24, 2018 3:00 p.m. Eastern Barbara DiPietro , National Health Care for the Homeless Council Mishka Taylor , Virginia Commonwealth University

278 views • 26 slides
Postharvest Losses of Horticultural Produce: Causes, Challenges & Strategies for Loss

Postharvest Losses of Horticultural Produce: Causes, Challenges & Strategies for Loss

Conference on Food Loss and Food waste Reduction and Recovery Postharvest Losses of Horticultural Produce: Causes, Challenges & Strategies for Loss Reduction I. Ramma Food and Agricultural Research and Extension Unit 27 Feb 2018 Content

694 views • 20 slides
5 SUBCONTRACTING RISK REDUCTION STRATEGIES RISK 1: LIABILITY FOR UNPAID SUBCONTRACTOR WCB

5 SUBCONTRACTING RISK REDUCTION STRATEGIES RISK 1: LIABILITY FOR UNPAID SUBCONTRACTOR WCB

5 SUBCONTRACTING RISK REDUCTION STRATEGIES RISK 1: LIABILITY FOR UNPAID SUBCONTRACTOR WCB PREMIUMS Workers Compensation Boards routinely recoup unpaid subcontractor premiums from their general contractors / clients. Recovery actions are common

504 views • 13 slides
Flood Risk Reduction Strategies for Vulnerable Coastal Populations along Hackensack River, Hudson

Flood Risk Reduction Strategies for Vulnerable Coastal Populations along Hackensack River, Hudson

Flood Risk Reduction Strategies for Vulnerable Coastal Populations along Hackensack River, Hudson River, Arthur Kill, Barnegat Bay and Delaware Bay Qizhong (George) Guo, Ph.D., P.E., D. WRE Professor and Principal Investigator Rutgers, The

1.22k views • 88 slides
IMPROPER PAYMENTS: A GOVERNMENT-WIDE OVERVIEW, 2014 ESTIMATES, AND REDUCTION STRATEGIES APRIL

IMPROPER PAYMENTS: A GOVERNMENT-WIDE OVERVIEW, 2014 ESTIMATES, AND REDUCTION STRATEGIES APRIL

IMPROPER PAYMENTS: A GOVERNMENT-WIDE OVERVIEW, 2014 ESTIMATES, AND REDUCTION STRATEGIES APRIL 28, 2015 BERYL H. BERRI DAVIS CGFM, CPA, CIA, CGAP, CGMA, CCSA DIRECTOR, FINANCIAL MANAGEMENT AND ASSURANCE DAVISBH@GAO.GOV 2015 CIGIE/GAO

638 views • 63 slides
Confluence via strong normalisation in an algebraic -calculus with rewriting Accepted in

Confluence via strong normalisation in an algebraic -calculus with rewriting Accepted in

Confluence via strong normalisation in an algebraic -calculus with rewriting Accepted in LSFA 2011. To appear in EPTCS Pablo Buiras 1 Alejandro Daz-Caro 2 Mauro Jaskelioff 1 , 3 1 Universidad Nacional de Rosario, FCEIA, Argentina 2

461 views • 43 slides
Exercises on -calculus and Deduction Systems Akim Demaille akim@lrde.epita.fr EPITA cole

Exercises on -calculus and Deduction Systems Akim Demaille akim@lrde.epita.fr EPITA cole

Exercises on -calculus and Deduction Systems Akim Demaille akim@lrde.epita.fr EPITA cole Pour lInformatique et les Techniques Avances June 10, 2016 Exercises on -calculus and Deduction Systems 1 -calculus Deduction Systems 2

939 views • 57 slides
The cost of usage in the -calculus Andrea Asperti 1 evy 2 Jean-Jacques L 1 DISI, University

The cost of usage in the -calculus Andrea Asperti 1 evy 2 Jean-Jacques L 1 DISI, University

The cost of usage in the -calculus Andrea Asperti 1 evy 2 Jean-Jacques L 1 DISI, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY Email: asperti@cs.unibo.it 2 INRIA Paris-Rocquencourt Le Chesnay, France Email:

479 views • 28 slides
Type Inference, Higher Order Algebra, and Lambda Calculus Bjrn Lisper School of Innovation,

Type Inference, Higher Order Algebra, and Lambda Calculus Bjrn Lisper School of Innovation,

Type Inference, Higher Order Algebra, and Lambda Calculus Bjrn Lisper School of Innovation, Design, and Engineering Mlardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/blr/ Type Inference, Higher Order Algebra, and Lambda

708 views • 53 slides
Lambda Calculus and Extensions as Foundation of Functional Programming David Sabel and Manfred

Lambda Calculus and Extensions as Foundation of Functional Programming David Sabel and Manfred

Lambda Calculus and Extensions as Foundation of Functional Programming David Sabel and Manfred Schmidt-Schau 29. September 2015 Lehrerbildungsforum Informatik Last update: 30. September 2015 1 Introduction Lambda Calculus Connection to

738 views • 29 slides
Dynamically Typed Programming Languages Part 1: The Untyped -Calculus Jim Royer CIS 352

Dynamically Typed Programming Languages Part 1: The Untyped -Calculus Jim Royer CIS 352

Dynamically Typed Programming Languages Part 1: The Untyped -Calculus Jim Royer CIS 352 April 16, 2019 Royer Dynamically Typed Programming Languages 1 / 22 Reference Practical Foundations for Programming Languages, 2/e, Part VI:

408 views • 28 slides
CMSC 430 Introduction to Compilers Spring 2016 Type Systems What is a Type System? A type

CMSC 430 Introduction to Compilers Spring 2016 Type Systems What is a Type System? A type

CMSC 430 Introduction to Compilers Spring 2016 Type Systems What is a Type System? A type system is some mechanism for distinguishing good programs from bad Good programs = well typed Bad programs = ill-typed or not typable

765 views • 57 slides
Alloy Modeling Language meets SMT-LIB Forrest Cinelli, Kyle McCormick, Dan Dougherty WPI NSF

Alloy Modeling Language meets SMT-LIB Forrest Cinelli, Kyle McCormick, Dan Dougherty WPI NSF

Alloy Modeling Language meets SMT-LIB Forrest Cinelli, Kyle McCormick, Dan Dougherty WPI NSF Support 1408745 and 1714431 April 30 2018 1 / 11 Plan Talk about relationship between Alloy Language and SMT-LIB Want to raise questions to

237 views • 13 slides

More recommend