Relating Dataflow and Lambda-calculus

More documents

Recommendations

Info

Confluence of Optimizations y < x → True x = y + m y < x → False y = x + m 〈z | x = y + 3, y = x + 2,z = x < y〉 → 〈z | x = y + 3,y = x + 2,z = False〉 ↓ 〈z | x = y + 3, y = x + 2,z = True〉
Optimizations <strong>and</strong> Termination Can lifting free expressions impact termination? 〈a 1 | a = λy.a 0〉 → 〈(λy.a 0) 1 | a = λy.a 0〉 → 〈a 0 | a = λy.a 0〉 → · · · ↓lifting 〈a 1 | a = λy.b, b = a 0〉 ↓inlining 〈a 1 | a = λy.b, b = (λy.b) 0〉 ↓ 〈a 1 | a = λy.b, b = b〉 ↓ 〈a 1 | a = λy.b, b = •〉 ↓constant folding 〈a 1 | a = λy.•〉 → 〈• | a = λy.•〉 → •
Page 1 and 2: Relating Dataflow and Lambda-calcul
Page 3 and 4: Token Pushing Semantics Operational
Page 5 and 6: Transformations On Dataflow Graphs
Page 7 and 8: Sharing of Maximal Free Expressions
Page 9 and 10: In 1985 Corrado Böhm invites Arvin
Page 11 and 12: Again.... Arvind and Henk Barendreg
Page 13 and 14: Don’t worry - Gita was there!
Page 15 and 16: After Ustica Arvind came back speak
Page 17 and 18: We need to take sharing into accoun
Page 19 and 20: Equational GRS Give a name to each
Page 21 and 22: Two Intermediate Languages P-TAC -
Page 23: Correctness of optimizations We bas
Page 27 and 28: ..... even false Properties!!!!
Page 29 and 30: My life after CSG .....
Page 31 and 32: Why? How many years did it take to
Page 33 and 34: Detour: can be simplified to: Execu
Page 35 and 36: Logic and Control Operators How do
Page 37 and 38: Proof by Contradiction Prove A: ass
Page 39 and 40: Thanks Silvio Berlusconi! Henk Bare

Relating Dataflow and Lambda-calculus

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?