Understanding Late Typing in Loosely Coupled Recursion

Explore late typing in loosely coupled recursion through JavaScript and simply-typed calculations. Witness the intricacies of open function types and the guarantee-rely mechanism in defining functions for effective programming.

• Recursion
• JavaScript
• Simply-Typed
• Function Types
• Programming

stinnette_e Follow

Uploaded on Sep 28, 2024 | 0 Views

Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

Presentation Transcript

1. Late Typing for Loosely Coupled Recursion Ravi Chugh

2. JavaScript var tick = function (n) { return n > 0 ? "tick " + tock(n) : ""; }; var tock = function (n) { return "tock " + tick(n-1); }; tick(2); // "tick tock tick tock "

3. -Calc + Refs let (tick,tock) = (ref undef, ref undef) tick := \n. n > 0 ? "tick " + !tock n : "" tock := \n. "tock " + !tick (n-1) !tick 2 // "tick tock tick tock "

4. -Calc + Refs let (tick,tock) = (ref undef, ref undef) tick := \n. n > 0 ? "tick " + !tock n : "" tock := \n. "tock " + !tick (n-1) !tick 2 // "tick tock tick tock "

5. Simply-Typed -Calc + Refs val tick : ref (int -> str) let tick = ref (\_. "") val tock : ref (int -> str) let tock = ref (\_. "") tick := \n. n > 0 ? "tick " + !tock n : "" tock := \n. "tock " + !tick (n-1) !tick 2 // "tick tock tick tock "

6. Simply-Typed -Calc + Refs val tick : ref (int -> str) let tick = ref (\_. "") val tock : ref (int -> str) let tock = ref (\_. "") tick := \n. n > 0 ? "tick " + !tock n : "" tock := \n. "tock " + !tick (n-1) !tick 2 // "tick tock tick tock "

7. Open Function Types ( ) => T -> U

8. Open Function Types ( ) => T -> U Guarantee Rely

9. let tick = ref undefined let tock = ref undefined val f_tick : (*tock: int -> str) => int -> str let f_tick n = n > 0 ? "tick " + !tock n : "" val f_tock : (*tick: int -> str) => int -> str let f_tock n = "tock " + !tick (n-1) tick := f_tick // Rely: { *tick: int -> str , *tock: int -> str } // Guar: { *tick: int -> str , *tock: undefined } !tick 2 // ill-typed; run-time crash!

10. let tick = ref undefined let tock = ref undefined val f_tick : (*tock: int -> str) => int -> str let f_tick n = n > 0 ? "tick " + !tock n : "" val f_tock : (*tick: int -> str) => int -> str let f_tock n = "tock " + !tick (n-1) tick := f_tick tock := f_tock // Rely: { *tick: int -> str , *tock: int -> str } // Guar: { *tick: int -> str , *tock: int -> str } !tick 2 // well-typed; "tick tock tick tock "

11. Open Function Types ( ) => T -> U Guarantee Rely Late Checking at Calls

12. -Calc + Recds let tick this n = n > 0 ? "tick " + this.tock this n : "" let tock this n - "tock " + this.tick this (n-1) let obj = { tick = tick ; tock = tock } obj.tick obj 2 // "tick tock tick tock "

13. -Calc + Recds tick : ( : {tock: ->int->str}) => -> int -> str let tick this n = n > 0 ? "tick " + this.tock this n : "" tock : ( : {tick: ->int->str}) => -> int -> str let tock this n - "tock " + this.tick this (n-1) let obj = { tick = tick ; tock = tock } // Rely: { tick: ->int->str, tock: ->int->str } // Guar: { tick: ->int->str, tock: ->int->str

14. Late Typing for Loosely Coupled Recursion ( ) => T -> U