string diagram semantics for functional languages with
play

String-diagram semantics for functional languages with data-flow - PowerPoint PPT Presentation

Aug 29, 2022 •105 likes •1.54k views

String-diagram semantics for functional languages with data-flow Steven Cheung & Dan Ghica & Koko Moruya University of Birmingham 5th Jan 2018 GoI machine [Mackie 95] [Danos & Regnier 99] Geometry of interaction [Girard

  1. String-diagram semantics for functional languages with data-flow Steven Cheung & Dan Ghica & Koko Moruya University of Birmingham 5th Jan 2018

  2. GoI machine [Mackie ’95] [Danos & Regnier ’99] • Geometry of interaction [Girard ’89] • Token passing machine • a λ -term → a graph (proof-net) • evaluation = specific path travelled by the token

  3. GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  4. GoI machine Contraction C ( λ x.x + x) (1 + 1) Constants + λ 1 1 box structure Abstraction ! ! ! D + Dereliction Binary addition @ Application

  5. GoI machine C + λ 1 1 ! ! ! D + @ ? : □

  6. GoI machine C + λ 1 1 ! ! ! D + @ R : ? : □

  7. GoI machine C + λ 1 1 ! ! ! D + @ R : ? : □

  8. GoI machine C + λ 1 1 ! ! ! D + @ R : ? : □

  9. GoI machine C + λ 1 1 ! ! ! D + @ ? : □

  10. GoI machine C + λ 1 1 ! ! ! D + @ ? : ? : □

  11. GoI machine C + λ 1 1 ! ! ! D + @ ? : ? : □

  12. GoI machine C + λ 1 1 ! ! ! D + @ L : ? : ? : □

  13. GoI machine C + λ 1 1 ! ! ! D + @ L : ? : ? : □

  14. GoI machine C + λ 1 1 ! ! ! D + @ L : ? : ? : □

  15. GoI machine C + λ 1 1 ! ! ! D + @ ? : ? : □

  16. GoI machine C + λ 1 1 ! ! ! D + @ ? : ? : ? : □

  17. GoI machine C + λ 1 1 ! ! ! D + @ ? : ? : ? : □

  18. GoI machine C + λ 1 1 ! ! ! D + @ 1 : ? : ? : □

  19. GoI machine C + λ 1 1 ! ! ! D + @ ? : 1 : ? : ? : □

  20. GoI machine C + λ 1 1 ! ! ! D + @ ? : 1 : ? : ? : □

  21. GoI machine C + λ 1 1 ! ! ! D + @ 1 : 1 : ? : ? : □

  22. GoI machine C + λ 1 1 ! ! ! D + @ 2 : ? : □

  23. GoI machine C + λ 1 1 ! ! ! D + @ L : 2 : ? : □

  24. GoI machine C + λ 1 1 ! ! ! D + @ L : 2 : ? : □

  25. GoI machine C + λ 1 1 ! ! ! D + @ L : 2 : ? : □

  26. GoI machine C + λ 1 1 ! ! ! D + @ 2 : ? : □

  27. GoI machine C + λ 1 1 ! ! ! D + @ 2 : ? : □

  28. GoI machine C + λ 1 1 ! ! ! D + @ ? : 2 : ? : □

  29. GoI machine C + λ 1 1 ! ! ! D + @ ? : 2 : ? : □

  30. GoI machine C + λ 1 1 ! ! ! D + @ L : ? : 2 : ? : □

  31. GoI machine C + λ 1 1 ! ! ! D + @ L : ? : 2 : ? : □

  32. GoI machine C + λ 1 1 ! ! ! D + @ L : ? : 2 : ? : □

  33. GoI machine C + λ 1 1 ! ! ! D + @ ? : 2 : ? : □

  34. GoI machine C + λ 1 1 ! ! ! D + @ ? : ? : 2 : ? : □

  35. GoI machine C + λ 1 1 ! ! ! D + @ ? : ? : 2 : ? : □

  36. GoI machine C + λ 1 1 ! ! ! D + @ 1 : ? : 2 : ? : □

  37. GoI machine C + λ 1 1 ! ! ! D + @ ? : 1 : ? : 2 : ? : □

  38. GoI machine C + λ 1 1 ! ! ! D + @ ? : 1 : ? : 2 : ? : □

  39. GoI machine C + λ 1 1 ! ! ! D + @ 1 : 1 : ? : 2 : ? : □

  40. GoI machine C + λ 1 1 ! ! ! D + @ 2 : 2 : ? : □

  41. GoI machine C + λ 1 1 ! ! ! D + @ L : 2 : 2 : ? : □

  42. GoI machine C + λ 1 1 ! ! ! D + @ L : 2 : 2 : ? : □

  43. GoI machine C + λ 1 1 ! ! ! D + @ L : 2 : 2 : ? : □

  44. GoI machine C + λ 1 1 ! ! ! D + @ 2 : 2 : ? : □

  45. GoI machine C + λ 1 1 ! ! ! D + @ 2 : 2 : ? : □

  46. GoI machine C + λ 1 1 ! ! ! D + @ 4 : □

  47. GoI machine C + λ 1 1 ! ! ! D + @ R : 4 : □

  48. GoI machine C + λ 1 1 ! ! ! D + @ R : 4 : □

  49. GoI machine C + λ 1 1 ! ! ! D + @ R : 4 : □

  50. GoI machine C + λ 1 1 ! ! ! D + @ 4 : □

  51. GoI machine C + λ 1 1 ! ! ! D + @ 4 : □

  52. GoI machine [Mackie ’95] [Danos & Regnier ’99] • Fixed graph = constants space • Compilation to circuit [Ghica ’07] • ✔ call-by-name, ? call-by-value

  53. Dynamic GoI machine [Muroya & Ghica ’17] • Framework for defining FPL semantics • Combine token passing & graph rewriting • di ff erent interleaving = di ff erent strategy

  54. Dynamic GoI machine [Muroya & Ghica ’17] C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  55. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  56. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  57. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  58. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  59. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  60. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  61. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  62. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  63. Dynamic GoI machine C ( λ x.x + x) (1 + 1) + λ 1 1 ! ! ! D + @

  64. Dynamic GoI machine C C ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 + + λ λ 1 1 ! ! ! ! 2 D + D ! @ @

  65. Dynamic GoI machine C ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 + λ ! 2 D ! @

  66. Dynamic GoI machine C ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 + λ ! 2 D ! @

  67. Dynamic GoI machine C ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 + λ ! 2 D ! @

  68. Dynamic GoI machine C ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 + λ ! 2 D ! @

  69. Dynamic GoI machine C ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 C + + 2 λ λ ! ! 2 @ D ! @

  70. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 C + 2 λ ! @

  71. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 C + 2 λ ! @

  72. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 C ↦ x + x [x ↦ 2] 2 + 2 ! λ ! C + @

  73. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ! C +

  74. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ! C +

  75. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ! C +

  76. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ! C +

  77. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 2 ↦ x + 2 [x ↦ 2] ! ! 2 C C ! + +

  78. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ↦ x + 2 [x ↦ 2] ! 2 C ! +

  79. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ↦ x + 2 [x ↦ 2] ! 2 C ! +

  80. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ↦ x + 2 [x ↦ 2] ! 2 C ! +

  81. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ↦ x + 2 [x ↦ 2] ! 2 C ! +

  82. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ↦ x + 2 [x ↦ 2] ! 2 C ! +

  83. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 ↦ x + 2 [x ↦ 2] 2 2 ↦ 2 + 2 [x ↦ 2] ! 2 ! ! C ! + +

  84. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] ↦ x + 2 [x ↦ 2] 2 2 ↦ 2 + 2 [x ↦ 2] ! ! +

  85. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] ↦ x + 2 [x ↦ 2] 2 2 ↦ 2 + 2 [x ↦ 2] ! ! +

  86. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] ↦ x + 2 [x ↦ 2] 2 2 ↦ 2 + 2 [x ↦ 2] ! ! +

  87. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] ↦ x + 2 [x ↦ 2] 2 2 ↦ 2 + 2 [x ↦ 2] 4 ↦ 4 [x ↦ 2] ! ! ! +

  88. DGoIM & data-flow model • GoI graph ~ data-flow graph • preserve data-flow by suppressing certain rewrites

  89. Dynamic GoI machine ( λ x.x + x) (1 + 1) ↦ ( λ x.x + x) 2 ↦ x + x [x ↦ 2] 2 2 ↦ x + 2 [x ↦ 2] ! ! 2 C C ! + +

  90. DGoIM & data-flow model 2 ¡ Ɔ +

  91. DGoIM & data-flow model 2 ¡ Ɔ + ? : □

  92. DGoIM & data-flow model 2 ¡ Ɔ + ? : ? : □

  93. DGoIM & data-flow model 2 ¡ Ɔ + ? : ? : □

  94. DGoIM & data-flow model 2 ¡ Ɔ + ? : ? : □

  95. DGoIM & data-flow model 2 ¡ Ɔ + 2 : ? : □

  96. DGoIM & data-flow model 2 ¡ Ɔ + 2 : ? : □

  97. DGoIM & data-flow model 2 ¡ Ɔ + ? : 2 : ? : □

  98. DGoIM & data-flow model 2 ¡ Ɔ + ? : 2 : ? : □

  99. DGoIM & data-flow model 2 ¡ Ɔ + ? : 2 : ? : □

  100. DGoIM & data-flow model 2 ¡ Ɔ + 2 : 2 : ? : □

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

String-diagram semantics for functional languages with data-flow Steven Cheung & Dan Ghica

String-diagram semantics for functional languages with data-flow Steven Cheung & Dan Ghica

String-diagram semantics for functional languages with data-flow Steven Cheung & Dan Ghica & Koko Moruya University of Birmingham 9th Sep 2017 GoI machine [Mackie 95] [Danos & Regnier 99] Geometry of interaction [Girard

827 views • 70 slides
CSEP505: Programming Languages Lecture 2: functional programming, syntax, semantics via

CSEP505: Programming Languages Lecture 2: functional programming, syntax, semantics via

CSEP505: Programming Languages Lecture 2: functional programming, syntax, semantics via interpretation or translation Dan Grossman Spring 2006 Where are we Programming: Done: Caml tutorial, definition of functions Idioms using

770 views • 59 slides
String Diagrams Paul-Andr Mellis Oregon Summer School in Programming Languages June 2011

String Diagrams Paul-Andr Mellis Oregon Summer School in Programming Languages June 2011

Programming Languages in String Diagrams [ one ] String Diagrams Paul-Andr Mellis Oregon Summer School in Programming Languages June 2011 String diagrams A diagrammatic account of logic and programming 2 Semantics in the 1980s

647 views • 64 slides
Functional Languages 101 Whats All the Fuss About? Rebecca Parsons ThoughtWorks Agenda

Functional Languages 101 Whats All the Fuss About? Rebecca Parsons ThoughtWorks Agenda

Functional Languages 101 Whats All the Fuss About? Rebecca Parsons ThoughtWorks Agenda What makes a language functional? An larger example The case for renewed interest in functional languages languages Other neat and nifty

502 views • 38 slides
CSC 1800 Organization of Programming Languages Functional Languages 1 Introduction The

CSC 1800 Organization of Programming Languages Functional Languages 1 Introduction The

CSC 1800 Organization of Programming Languages Functional Languages 1 Introduction The design of the imperative languages is based directly on the von Neumann architecture Efficiency is the primary concern, rather than the suitability of

417 views • 24 slides
CS 335 Software Development Object-Oriented Versus Functional Programming; The Visitor

CS 335 Software Development Object-Oriented Versus Functional Programming; The Visitor

CS 335 Software Development Object-Oriented Versus Functional Programming; The Visitor Pattern April 1416, 2014 Functional vs OO interface Animal { String happyNoise(); String excitedNoise(); } class Dog implements Animal { String

571 views • 17 slides
Natural Language Processing Lecture 18a: Meaning Representation Languages Semantics Road Map

Natural Language Processing Lecture 18a: Meaning Representation Languages Semantics Road Map

Natural Language Processing Lecture 18a: Meaning Representation Languages Semantics Road Map 1. Lexical semantics 2. Vector semantics 3. Meaning representation languages and semantic roles 4. Compositional semantics, semantic parsing 5.

542 views • 30 slides
) YEH # #t A ( Th Aa ITT ' D Y = $2 R2 IR ' v - . . i diagram of K

) YEH # #t A ( Th Aa ITT ' D Y = $2 R2 IR ' v - . . i diagram of K

a punctured sphere Knot diagrams on string figures of a model as l # KEEFE ) ' is Eu U 434 l 'kEiEI k3 ) ) YEH # #t A ( Th Aa ITT ' D Y = $2 R2 IR ' v - . . i diagram of K DE $2 knot KE $3 : :

311 views • 16 slides
Semantics of programming languages Informatics 2A: Lecture 27 John Longley School of Informatics

Semantics of programming languages Informatics 2A: Lecture 27 John Longley School of Informatics

What is programming language semantics? Micro-Haskell: crash course Operational semantics Denotational semantics Semantics of programming languages Informatics 2A: Lecture 27 John Longley School of Informatics University of Edinburgh

465 views • 19 slides
A Discriminative Model for Semantics-to-String Translation s Tamchyna 1 and Chris Quirk 2 and

A Discriminative Model for Semantics-to-String Translation s Tamchyna 1 and Chris Quirk 2 and

A Discriminative Model for Semantics-to-String Translation s Tamchyna 1 and Chris Quirk 2 and Michel Galley 2 Ale 1 Charles University in Prague 2 Microsoft Research July 30, 2015 Tamchyna, Quirk, Galley Semantics-to-String Translation July

385 views • 14 slides
CSE 322 Exam Reviews Basic Concepts Formal Languages Language/String Operations

CSE 322 Exam Reviews Basic Concepts Formal Languages Language/String Operations

CSE 322 Exam Reviews Basic Concepts Formal Languages Language/String Operations Alphabet ( ! ) String ( ! *) Regular Operations: Union ( $ ) Length (|x|) Concatenation ( ) Empty String ( " )

149 views • 12 slides
Functional Programming Languages Liam OConnor CSE, UNSW (and data61) Term3 2019 1 The

Functional Programming Languages Liam OConnor CSE, UNSW (and data61) Term3 2019 1 The

The Functional Paradigm MinHS Functional Programming Languages Liam OConnor CSE, UNSW (and data61) Term3 2019 1 The Functional Paradigm MinHS Functional Programming Many languages have been called functional over the years: Haskell

319 views • 17 slides
Functional Programming Languages Liam OConnor CSE, UNSW (and data61) Term3 2019 1 The

Functional Programming Languages Liam OConnor CSE, UNSW (and data61) Term3 2019 1 The

The Functional Paradigm MinHS Functional Programming Languages Liam OConnor CSE, UNSW (and data61) Term3 2019 1 The Functional Paradigm MinHS Functional Programming Many languages have been called functional over the years: Lisp (

1.01k views • 66 slides
Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar

Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar

Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar with a sample small language for the purpose of semantic specification Understand operational semantics Understand denotational semantics

789 views • 48 slides
Formal Languages S ={a,b} Alphabet: a finite set of symbols String: a finite sequence of

Formal Languages S ={a,b} Alphabet: a finite set of symbols String: a finite sequence of

Formal Languages S ={a,b} Alphabet: a finite set of symbols String: a finite sequence of symbols ababbaab Language: a (possibly ) set of strings L={a,aa,aaa ,} String length: number of symbols in it |aba|=3 Empty string:

1.69k views • 103 slides
Formal Languages: Review Alphabet: a finite set of symbols S={a,b} String: a finite

Formal Languages: Review Alphabet: a finite set of symbols S={a,b} String: a finite

Formal Languages: Review Alphabet: a finite set of symbols S={a,b} String: a finite sequence of symbols ababbaab Language: a set of strings L={a,aa,aaa ,} String length: number of symbols in it |aba|=3 String concatenation:

1.3k views • 76 slides
Right-handed Currents in Single and Double Beta Decay v Werner Rodejohann m v = m L - m D M -1 m

Right-handed Currents in Single and Double Beta Decay v Werner Rodejohann m v = m L - m D M -1 m

Right-handed Currents in Single and Double Beta Decay v Werner Rodejohann m v = m L - m D M -1 m D T R NDM 2015 MANITOP 03/06/15 Massive Neutrinos: Investigating their Theoretical Origin and Phenomenology 1 Left-right Symmetry very simple

533 views • 37 slides
IR fixed points in SU(3) Gauge Theories Y. Iwasaki U.Tsukuba and KEK In Collaboration with

IR fixed points in SU(3) Gauge Theories Y. Iwasaki U.Tsukuba and KEK In Collaboration with

2015/03/03 SCGT15 IR fixed points in SU(3) Gauge Theories Y. Iwasaki U.Tsukuba and KEK In Collaboration with K.-I. Ishikawa(U. Horoshima) Yu Nakayama(Caltech & IPMU) T. Yoshie(U. Tsukuba) Plan of Talk Introduction Phase structure

504 views • 35 slides
Game-Playing & Adversarial Search This lecture topic: Game-Playing & Adversarial Search

Game-Playing & Adversarial Search This lecture topic: Game-Playing & Adversarial Search

Game-Playing & Adversarial Search This lecture topic: Game-Playing & Adversarial Search (two lectures) Chapter 5.1-5.5 Next lecture topic: Constraint Satisfaction Problems (two lectures) Chapter 6.1-6.4, except 6.3.3 (Please read

980 views • 68 slides
P1 Orientation Programme 28 December 2015 Staff of Oasis Primary School Oasis Primary School

P1 Orientation Programme 28 December 2015 Staff of Oasis Primary School Oasis Primary School

2015 P1 Orientation Programme 28 December 2015 Staff of Oasis Primary School Oasis Primary School Contract Period : 21 Nov 2014 20 May 2016 TOP : 27 Nov 2015 School Building Super Hall School Management Team Mr Ng Buck Chwee

490 views • 33 slides
UPPMAX Introduction 2019-09-09 Martin Dahl martin.dahlo@scilifelab.uu.se Objectives What is

UPPMAX Introduction 2019-09-09 Martin Dahl martin.dahlo@scilifelab.uu.se Objectives What is

UPPMAX Introduction 2019-09-09 Martin Dahl martin.dahlo@scilifelab.uu.se Objectives What is UPPMAX what it provides Projects at UPPMAX How to access UPPMAX Jobs and queuing systems How to use the resources of UPPMAX How to use the

991 views • 70 slides
Comments for: Two Cheers for Akrasia by Kevin Dorst Konstan3n Genin Carnegie Mellon University

Comments for: Two Cheers for Akrasia by Kevin Dorst Konstan3n Genin Carnegie Mellon University

Comments for: Two Cheers for Akrasia by Kevin Dorst Konstan3n Genin Carnegie Mellon University 2018 Eastern APA Savannah, Georgia Probabilis3c Frames W is a set of possible worlds . P is a func3on mapping world w to P w, the uniquely

481 views • 18 slides
Deployment Automation Bianca Henderson & Self-Healing with Product Field Engineer Ansible

Deployment Automation Bianca Henderson & Self-Healing with Product Field Engineer Ansible

Deployment Automation Bianca Henderson & Self-Healing with Product Field Engineer Ansible Dynatrace & Ansible Jrgen Etzlstorfer Technology Strategist Dynatrace Who we are Bianca has been using Ansible since June of Jrgen

388 views • 17 slides
Transcendental Brauer elements and descent on elliptic surfaces Bianca Viray Brown University

Transcendental Brauer elements and descent on elliptic surfaces Bianca Viray Brown University

Transcendental Brauer elements and descent on elliptic surfaces Bianca Viray Brown University Ramification in Algebra and Geometry Emory University May 18, 2011 Bianca Viray (Brown University) Transcendental Brauer elements and descent The

711 views • 22 slides

More recommend