uniform atomic ordered linear logic
play

Uniform Atomic Ordered Linear Logic A Meta-Circular Interpreter for - PowerPoint PPT Presentation

Uniform Atomic Ordered Linear Logic A Meta-Circular Interpreter for Olli Jeff Polakow Awake Security September 8, 2017 Outline Ordered Linear Logic Meta-Circular Interpreters Unsplitting Ordered Contexts Uniform Atomic Ordered Linear Logic


  1. Uniform Atomic Ordered Linear Logic A Meta-Circular Interpreter for Olli Jeff Polakow Awake Security September 8, 2017

  2. Outline Ordered Linear Logic Meta-Circular Interpreters Unsplitting Ordered Contexts Uniform Atomic Ordered Linear Logic Meta-Circular Interpreter for Olli

  3. Purely Ordered Logic (Lambek Calculus) Ω ` A

  4. Purely Ordered Logic (Lambek Calculus) Ω ` A A ` Ainit

  5. Purely Ordered Logic (Lambek Calculus) Ω ` A A ` Ainit Ω L , B , Ω R ` C Ω A ` A Ω , A ` B Ω ` A ⇣ B ⇣ R ⇣ L Ω L , A ⇣ B , Ω A , Ω R ` C

  6. Purely Ordered Logic (Lambek Calculus) Ω ` A A ` Ainit Ω , A ` B Ω L , B , Ω R ` C Ω A ` A Ω ` A ⇣ B ⇣ R ⇣ L Ω L , A ⇣ B , Ω A , Ω R ` C Ω L , B , Ω R ` C Ω A ` A A , Ω ` B Ω ` A ⇢ B ⇢ R ⇢ L Ω L , Ω A , A ⇢ B , Ω R ` C

  7. Adding Linear Hypotheses ∆ ; Ω ` A

  8. Adding Linear Hypotheses ∆ ; Ω ` A ∆ ; Ω L , A , Ω R ` C · ; A ` A init place ∆ . / A ; Ω L , Ω R ` C . / is non-deterministic merge

  9. Adding Linear Hypotheses ∆ ; Ω ` A ∆ ; Ω L , A , Ω R ` C · ; A ` A init / A ; Ω L , Ω R ` C place ∆ . ∆ , A ; Ω ` B ∆ ; Ω L , B , Ω R ` C ∆ A ; · ` A ∆ ; Ω ` A ( B ( R ( L ∆ . / ∆ A ; Ω L , A ( B , Ω R ` C

  10. Adding Linear Hypotheses ∆ ; Ω ` A ∆ ; Ω L , A , Ω R ` C · ; A ` A init / A ; Ω L , Ω R ` C place ∆ . ∆ , A ; Ω ` B ∆ ; Ω L , B , Ω R ` C ∆ A ; · ` A ∆ ; Ω ` A ( B ( R ( L / ∆ A ; Ω L , A ( B , Ω R ` C ∆ . ∆ ; Ω , A ` B ∆ ; Ω L , B , Ω R ` C ∆ A ; Ω A ` A ∆ ; Ω ` A ⇣ B ⇣ R / ∆ A ; Ω L , A ⇣ B , Ω A , Ω R ` C ⇣ L ∆ . ∆ ; A , Ω ` B ∆ ; Ω L , B , Ω R ` C ∆ A ; Ω A ` A ∆ ; Ω ` A ⇢ B ⇢ R / ∆ A ; Ω L , Ω A , A ⇢ B , Ω R ` C ⇢ L ∆ .

  11. Ordered Uniform Linear Logic Formulas D ::= P | 8 x . D | > | D & D | G ⇣ D | G ⇢ D | G ( D | G ! D G ::= P | 8 x . G | 9 x . G | | G & G > | | G � G 0 | 1 | G • G | G � G | D ⇣ G | D ⇢ G | ¡ G | D ( G | ! G | D ! G

  12. Ordered Uniform Linear Logic Derivations Γ ; ∆ ; Ω ` G Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P focussed judgment represents Γ ; ∆ ; Ω L , D , Ω R ` P

  13. Ordered Uniform Linear Logic Derivations Γ ; ∆ ; Ω ` G Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Γ ; ∆ 0 ; Ω 0 ` G 0 Γ ; ∆ 1 ; Ω 1 ` G 1 • R Γ ; ∆ 0 . / ∆ 1 ; Ω 0 , Ω 1 ` G 0 • G 1 Γ ; ∆ 0 ; Ω 0 ` G 0 Γ ; ∆ 1 ; Ω 1 ` G 1 � R Γ ; ∆ 0 . / ∆ 1 ; Ω 1 , Ω 0 ` G 0 � G 1 Γ ; ∆ ; Ω , D ` G Γ ; ∆ ; D , Ω ` G Γ ; ∆ ; Ω ` D ⇣ G ⇣ R Γ ; ∆ ; Ω ` D ⇢ G ⇢ R Γ ; ∆ , D ; Ω ` G Γ , D ; ∆ ; Ω ` G Γ ; ∆ ; Ω ` D ! G ! R Γ ; ∆ ; Ω ` D ( G ( R

  14. Ordered Uniform Linear Logic Derivations Γ ; ∆ ; Ω ` G Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P choice Ω Γ ; ∆ ; Ω L , D , Ω R ` P Γ ; ∆ L , ∆ R ; ( Ω L ; Ω R ) ` D � P / D , ∆ R ; Ω L , Ω R ` P choice ∆ Γ ; ∆ L . / D ; ∆ ; ( Ω L ; Ω R ) ` D � P Γ . choice Γ Γ . / D ; ∆ ; Ω L , Ω R ` P

  15. Ordered Uniform Linear Logic Derivations Γ ; ∆ ; Ω ` G Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Γ ; ∆ G ; Ω G ` G ⇣ L Γ ; ∆ G . / ∆ ; ( Ω L ; Ω G , Ω R ) ` G ⇣ D � P Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Γ ; ∆ G ; Ω G ` G / ∆ ; ( Ω L , Ω G ; Ω R ) ` G ⇢ D � P ⇢ L Γ ; ∆ G . Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Γ ; ∆ G ; · ` G ( L Γ ; ∆ G . / ∆ ; ( Ω L ; Ω R ) ` G ( D � P Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Γ ; · ; · ` G ! L Γ ; ∆ ; ( Ω L ; Ω R ) ` G ! D � P

  16. Outline Ordered Linear Logic Meta-Circular Interpreters Unsplitting Ordered Contexts Uniform Atomic Ordered Linear Logic Meta-Circular Interpreter for Olli

  17. Meta-Circular Interpreter: Pure Linear Logic Pure Linear Logic: ∆ ` G ∆ ` D � P

  18. Meta-Circular Interpreter: Pure Linear Logic Pure Linear Logic: ∆ ` G ∆ ` D � P ∆ , D ` G ∆ ` D � P ∆ ` D ( G ∆ . / D ` P

  19. Meta-Circular Interpreter: Pure Linear Logic Pure Linear Logic: ∆ ` G ∆ ` D � P ∆ , D ` G ∆ ` D � P ∆ ` D ( G ∆ . / D ` P ∆ ` D � P ∆ G ` G · ` P � P ∆ . / ∆ G ` G ( D � P

  20. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . ∆ ` G ∆ ` D � P goal G. focus D P.

  21. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . goal (D =o G) o � ( hyp D � o goal G) . ∆ , D ` G ∆ ` D ( G

  22. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . goal (D =o G) o � ( hyp D � o goal G) . goal ( atm P) o � hyp D, focus D P. ∆ ` D � P ∆ . / D ` P

  23. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . goal (D =o G) o � ( hyp D � o goal G) . goal ( atm P) o � hyp D, focus D P. focus ( atm P) P. · ` P � P

  24. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . goal (D =o G) o � ( hyp D � o goal G) . goal ( atm P) o � hyp D, focus D P. focus ( atm P) P. focus (G =o D) P o � focus D P, goal G. ∆ ` D � P ∆ G ` G ∆ . / ∆ G ` G ( D � P

  25. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . = > : frm � > frm � > frm . bang : frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . Γ ; ∆ ` G Γ ; ∆ ` D � P goal G. focus D P.

  26. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . = > : frm � > frm � > frm . bang : frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . goal (D = > G) o � ( hyp D � > goal G) . Γ , D ; ∆ ` G Γ ; ∆ ` D ! G

  27. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . = > : frm � > frm � > frm . bang : frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . goal (D = > G) o � ( hyp D � > goal G) . focus (G = > D) P o � focus D P, goal ( bang G) . Γ ; ∆ ` D � P Γ ; · ` G Γ ; ∆ ` G ! D � P

  28. Meta-Circular Interpreter: Encoding frm : type . atom : type . atm : atom � > frm . =o : frm � > frm � > frm . = > : frm � > frm � > frm . bang : frm � > frm . hyp : frm � > o . goal : frm � > o . focus : frm � > atom � > o . goal (D = > G) o � ( hyp D � > goal G) . focus (G = > D) P o � focus D P, goal ( bang G) . goal ( bang G) o � !G. Γ ; · ` G Γ ; · ` ! G

  29. Meta-Circular Interpreter: Ordered Linear Logic Ordered Linear Logic: Γ ; ∆ ; Ω ` G Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P

  30. Meta-Circular Interpreter: Ordered Linear Logic Ordered Linear Logic: Γ ; ∆ ; Ω ` G Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Problem: No way to represent split ordered context.

  31. Meta-Circular Interpreter: Ordered Linear Logic Ordered Linear Logic: Γ ; ∆ ; Ω ` G Γ ; ∆ ; ( Ω L ; Ω R ) ` D � P Problem: No way to represent split ordered context. Solution: Remove need for splitting ordered context.

  32. Outline Ordered Linear Logic Meta-Circular Interpreters Unsplitting Ordered Contexts Uniform Atomic Ordered Linear Logic Meta-Circular Interpreter for Olli

  33. Residuation Logically “compile” clause into new goal. Removes need to split ordered context when focussing on non-ordered clause. Γ ; ∆ L , ∆ R ; ( Ω L ; Ω R ) ` D � P choice ∆ Γ ; ∆ L , D , ∆ R ; Ω L , Ω R ` P Γ . / D ; ∆ ; ( Ω L ; Ω R ) ` D � P choice Γ / D ; ∆ ; Ω L , Ω R ` P Γ .

  34. Residuation Logically “compile” clause into new goal. G I ; D � P \ G O

  35. Residuation Logically “compile” clause into new goal. G I ; D � P \ G O G I ; D � P \ G O G ; P � P \ G G I ; 8 x . D � P \ 9 x . G O

  36. Residuation Logically “compile” clause into new goal. G I ; D � P \ G O G I ; D � P \ G O G ; P � P \ G G I ; 8 x . D � P \ 9 x . G O G I ; D 0 � P \ G 0 G I ; D 1 � P \ G 1 G ; > � P \ 0 G I ; D 0 & D 1 � P \ G 0 � G 1

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


More recommend