resugaring lifting evaluation sequences through syntactic
play

Resugaring: Lifting Evaluation Sequences through Syntactic Sugar - PowerPoint PPT Presentation

Feb 17, 2024 •154 likes •825 views

Resugaring: Lifting Evaluation Sequences through Syntactic Sugar Justin Pombrio, Shriram Krishnamurthi Brown University Syntactic Sugar 2 Syntactic Sugar desugar x + 2 x . _ _ a d d _ _ ( 2 ) 3 Syntactic Sugar desugar x

  1. Resugaring: Lifting Evaluation Sequences through Syntactic Sugar Justin Pombrio, Shriram Krishnamurthi Brown University

  2. Syntactic Sugar 2

  3. Syntactic Sugar desugar x + 2 x . _ _ a d d _ _ ( 2 ) 3

  4. Syntactic Sugar desugar x + 2 x . _ _ a d d _ _ ( 2 ) desugar [ x * x | x < - l s t ] m a p ( \ x - > x * x ) l s t 4

  5. Syntactic Sugar desugar x + 2 x . _ _ a d d _ _ ( 2 ) desugar [ x * x | x < - l s t ] m a p ( \ x - > x * x ) l s t desugar x o r y l e t t = x i n i f t t h e n t e l s e y 5

  6. Surface language (what you write) Syntactic Sugar desugar x + 2 x . _ _ a d d _ _ ( 2 ) desugar [ x * x | x < - l s t ] m a p ( \ x - > x * x ) l s t desugar x o r y l e t t = x i n i f t t h e n t e l s e y 6

  7. Surface language Core language (what you write) (what runs) Syntactic Sugar desugar x + 2 x . _ _ a d d _ _ ( 2 ) desugar [ x * x | x < - l s t ] m a p ( \ x - > x * x ) l s t desugar x o r y l e t t = x i n i f t t h e n t e l s e y 7

  8. Big surface language desugar Small core 8

  9. Big surface language desugar Small core 9

  10. Big surface language desugar Code analyzer Small Refactoring engine core Evaluator 10

  11. Big surface language desugar Code analyzer Small Refactoring engine core Evaluator 11

  12. Big surface language desugar Code analyzer Small Refactoring engine core Evaluator Evaluator 12

  13. Surface Core n o t ( t r u e ) o r t r u e 13

  14. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e 14

  15. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e l e t t = f a l s e i n i f t t h e n t e l s e t r u e i f f a l s e t h e n f a l s e e l s e t r u e t r u e 15

  16. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e f a l s e o r t r u e l e t t = f a l s e i n i f t t h e n t e l s e t r u e i f f a l s e t h e n f a l s e e l s e t r u e t r u e t r u e 16

  17. Confection core eval seq → surface eval seq 17

  18. 18

  19. 92 steps 19

  20. 92 steps 7 steps 20

  21. Surface Core n o t ( t r u e ) o r t r u e Resugaring: Running sugar in reverse 21

  22. Surface Core n o t ( t r u e ) o r t r u e f a l s e o r t r u e t r u e Resugaring: Running sugar in reverse 22

  23. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e f a l s e o r t r u e t r u e Resugaring: Running sugar in reverse 23

  24. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e f a l s e o r t r u e l e t t = f a l s e i n i f t t h e n t e l s e t r u e i f f a l s e t h e n f a l s e e l s e t r u e t r u e t r u e Resugaring: Running sugar in reverse 24

  25. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n resugar i f t t h e n t e l s e t r u e f a l s e o r t r u e l e t t = f a l s e i n i f t t h e n t e l s e t r u e i f f a l s e t h e n f a l s e e l s e t r u e t r u e t r u e Resugaring: Running sugar in reverse 25

  26. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n resugar i f t t h e n t e l s e t r u e resugar f a l s e o r t r u e l e t t = f a l s e i n i f t t h e n t e l s e t r u e i f f a l s e t h e n f a l s e e l s e t r u e t r u e t r u e Resugaring: Running sugar in reverse 26

  27. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n resugar i f t t h e n t e l s e t r u e resugar f a l s e o r t r u e l e t t = f a l s e i n i f t t h e n t e l s e t r u e resugar i f f a l s e t h e n f a l s e e l s e t r u e t r u e t r u e Resugaring: Running sugar in reverse 27

  28. THREE KEY PROPERTIES OF RESUGARING 28

  29. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e resugar l e t t = f a l s e i n i f t t h e n t e l s e t r u e 29

  30. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e resugar t r u e o r t r u e l e t t = f a l s e i n o r t r u e i f t t h e n t e l s e t r u e 30

  31. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e resugar t r u e o r t r u e l e t t = f a l s e i n o r t r u e i f t t h e n t e l s e t r u e Emulation Each surface term must desugar to the core term it purports to represent 31

  32. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e resugar l e t t = f a l s e i n i f t t h e n t e l s e t r u e 32

  33. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e resugar l e t t = f a l s e i n l e t t = f a l s e i n i f t t h e n t e l s e t r u e i f t t h e n t e l s e t r u e 33

  34. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e resugar l e t t = f a l s e i n l e t t = f a l s e i n i f t t h e n t e l s e t r u e i f t t h e n t e l s e t r u e Abstraction Show things in terms of a sugar precisely when the programmer used that sugar. 34

  35. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e resugar l e t t = f a l s e i n i f t t h e n t e l s e t r u e resugar i f f a l s e t h e n f a l s e e l s e t r u e resugar t r u e t r u e 35

  36. Surface Core desugar n o t ( t r u e ) o r t r u e l e t t = n o t ( t r u e ) i n i f t t h e n t e l s e t r u e resugar Coverage l e t t = f a l s e i n i f t t h e n t e l s e t r u e Show as many steps resugar as possible i f f a l s e t h e n f a l s e e l s e t r u e resugar t r u e t r u e 36

  37. x o r y - > l e t t = x i n i f t t h e n t e l s e y 37

  38. expand match substitute x o r y - > l e t t = x i n i f t t h e n t e l s e y 38

  39. expand match substitute x o r y - > l e t t = x i n i f t t h e n t e l s e y substitute match unexpand 39

  40. A Little Theory expand : Surf Term → Core Term unexpand : Core Term × Surf Term → Surf Term 40

  41. A Little Theory expand : Surf Term → Core Term unexpand : Core Term × Surf Term → Surf Term It's a lens! 41

  42. A Little Theory expand : Surf Term → Core Term unexpand : Core Term × Surf Term → Surf Term It's a lens! unexpand (expand T) T = T GetPut GetPut expand (unexpand T’ T) = T’ PutGet PutGet 42

  43. A Little Theory expand : Surf Term → Core Term unexpand : Core Term × Surf Term → Surf Term It's a lens! unexpand (expand T) T = T GetPut GetPut expand (unexpand T’ T) = T’ PutGet PutGet Well-formedness criteria on rules ensure these laws. 43

  44. Key Properties Emulation Abstraction Coverage 44

  45. Key Properties Emulation (Lens Laws) Abstraction Coverage 45

  46. Key Properties Emulation (Lens Laws) Abstraction (T agging – see paper) Coverage 46

  47. Key Properties Emulation (Lens Laws) Abstraction (T agging – see paper) Coverage (Empirical) 47

  48. A WORKING SYSTEM 48

  49. 92 steps 7 steps 49

  50. Surface Core ( o r ( a n d # t # f ) # f ) 50

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

B LEU ATRE : Flattening Syntactic Dependencies for MT Evaluation Dennis N. Mehay and Chris

B LEU ATRE : Flattening Syntactic Dependencies for MT Evaluation Dennis N. Mehay and Chris

TL-based MTE Other Approaches: Motivating B LEU ATRE B LEU ATRE : Flattening and Using Deps Experiments: w/ LDC TIDES MultiTrans Chinese References B LEU ATRE : Flattening Syntactic Dependencies for MT Evaluation Dennis N.

633 views • 41 slides
Option Values, Arrays, Sequences, and Lazy Evaluation Bjrn Lisper School of Innovation,

Option Values, Arrays, Sequences, and Lazy Evaluation Bjrn Lisper School of Innovation,

Option Values, Arrays, Sequences, and Lazy Evaluation Bjrn Lisper School of Innovation, Design, and Engineering Mlardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/blr/ Option Values, Arrays, Sequences, and Lazy Evaluation

711 views • 39 slides
JEFFERSON JOBOY 27 November 2018 1 LIFTING AWARENESS 2 GROUND RULES 3 What is a lifting

JEFFERSON JOBOY 27 November 2018 1 LIFTING AWARENESS 2 GROUND RULES 3 What is a lifting

JEFFERSON JOBOY 27 November 2018 1 LIFTING AWARENESS 2 GROUND RULES 3 What is a lifting operation? An operation concerned with the lifting or lowering of a load'. A 'load' is the item or items being lifted, which includes a person or people

380 views • 27 slides
Outline Information Retrieval (IR) Syntactic IR Problems of Syntactic IR Semantic

Outline Information Retrieval (IR) Syntactic IR Problems of Syntactic IR Semantic

Fausto Giunchiglia, Uladzimir Kharkevich , Ilya Zaihrayeu Concept Search : Semantics Enabled Syntactic Search June 2nd, 2008, Tenerife, Spain 1 Outline Information Retrieval (IR) Syntactic IR Problems of Syntactic IR Semantic

736 views • 22 slides
20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more

20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more

20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more generally behaviors are about Sequences are used integrating the concept of time into what is learned. In } to analyze time dependent data general,

298 views • 6 slides
A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP

A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP

Slide 0 A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems Amadeo Casas 1 Daniel Cabeza 2 Manuel Hermenegildo 1 , 2 { amadeo, herme } @cs.unm.edu { dcabeza, herme } @fi.upm.es 1 Depts. of Comp.

482 views • 25 slides
Treebank Grammars and Parser Evaluation Syntactic analysis (5LN455) 2016-11-15 Sara Stymne

Treebank Grammars and Parser Evaluation Syntactic analysis (5LN455) 2016-11-15 Sara Stymne

Treebank Grammars and Parser Evaluation Syntactic analysis (5LN455) 2016-11-15 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Recap: Probabilistic parsing Probabilistic context-free grammars A

802 views • 42 slides
Sequences Sequences are ordered lists of elements, e.g. 2, 3, 5, 7, 11, 13, 17, 19, . . . or a , b

Sequences Sequences are ordered lists of elements, e.g. 2, 3, 5, 7, 11, 13, 17, 19, . . . or a , b

Sequences, sums, cardinality 1 Myrto Arapinis School of Informatics University of Edinburgh October 1, 2014 1 Slides mainly borrowed from Richard Mayr 1 / 21 Sequences Sequences are ordered lists of elements, e.g. 2, 3, 5, 7, 11, 13, 17, 19, .

570 views • 39 slides
Lexical and Syntactic Analysis an example Example: We would like to recognize a language of

Lexical and Syntactic Analysis an example Example: We would like to recognize a language of

Lexical and Syntactic Analysis an example Example: We would like to recognize a language of arithmetic expressions containing expressions such as: 34 x+1 -x * 2 + 128 * (y - z / 3) The expressions can contain number constants sequences

1.1k views • 94 slides
PASSAGE Syntactic Representation: a Minimal Common Ground for Evaluation A. Vilnat (LIMSI &amp;

PASSAGE Syntactic Representation: a Minimal Common Ground for Evaluation A. Vilnat (LIMSI &amp;

PASSAGE Syntactic Representation: a Minimal Common Ground for Evaluation A. Vilnat (LIMSI &amp; Univ. Paris-Sud), P. Paroubek (LIMSI), E. de la Clergerie (Alpage-INRIA), G. Francopoulo (Tagmatica), M.L. Gu enot (Univ. Paris 4) May 20, 2010

370 views • 17 slides
NIOSH revised lifting equation Week 8 Dr. Belal Gharaibeh 1 Why use the NIOSH lifting equation?

NIOSH revised lifting equation Week 8 Dr. Belal Gharaibeh 1 Why use the NIOSH lifting equation?

NIOSH revised lifting equation Week 8 Dr. Belal Gharaibeh 1 Why use the NIOSH lifting equation? National Institute for Occupational Safety and Health (NIOSH) in the USA made a standard procedure for assessing the physical demands of

540 views • 14 slides
Progressive Multi-Jittered Sample Sequences Per Christensen Andrew Kensler Charlie

Progressive Multi-Jittered Sample Sequences Per Christensen Andrew Kensler Charlie

Progressive Multi-Jittered Sample Sequences Per Christensen Andrew Kensler Charlie Kilpatrick Pixar Animation Studios EGSR 2018, Karlsruhe Overview Motivation Survey + evaluation of existing sample sequences 3 new algorithms:

982 views • 63 slides
Introduction Syntactic analysis (5LN455) Syntactic parsing (5LN713/5LN717) 2017-11-07 Sara

Introduction Syntactic analysis (5LN455) Syntactic parsing (5LN713/5LN717) 2017-11-07 Sara

Introduction Syntactic analysis (5LN455) Syntactic parsing (5LN713/5LN717) 2017-11-07 Sara Stymne Department of Linguistics and Philology Mostly based on slides from Marco Kuhlmann Today Introduction to syntactic analysis Course

1.05k views • 42 slides
Lifting Jonathan Templeman Chief Executive 53% of Lifting 22% of Melrose Products overview

Lifting Jonathan Templeman Chief Executive 53% of Lifting 22% of Melrose Products overview

Lifting Jonathan Templeman Chief Executive 53% of Lifting 22% of Melrose Products overview Oil &amp; Gas Mining Crane and industrial Specialist fibre and steel rope High quality steel wire ropes High performance wire ropes Mooring,

341 views • 15 slides
The HISPACAT comparative database of syntactic constructions and its applications to syntactic

The HISPACAT comparative database of syntactic constructions and its applications to syntactic

Goals Theory Architecture Results Conclusions The HISPACAT comparative database of syntactic constructions and its applications to syntactic variation research Workshop on Research Infrastructure for Linguistic Variation Xavier Villalba

509 views • 20 slides
Sequences Sequences and Difference Equations &quot;Sequences&quot; is a central topic in

Sequences Sequences and Difference Equations &quot;Sequences&quot; is a central topic in

5mm. Sequences Sequences and Difference Equations &quot;Sequences&quot; is a central topic in mathematics: (Appendix A) x 0 , x 1 , x 2 , . . . , x n , . . . , Example: all odd numbers Hans Petter Langtangen 1 , 3 , 5 , 7 , . . . , 2 n + 1 , .

475 views • 5 slides
L ECTURE 3: D ECISION T REES Prof. Julia Hockenmaier juliahmr@illinois.edu Announcements Office

L ECTURE 3: D ECISION T REES Prof. Julia Hockenmaier juliahmr@illinois.edu Announcements Office

CS446 Introduction to Machine Learning (Fall 2013) University of Illinois at Urbana-Champaign http://courses.engr.illinois.edu/cs446 L ECTURE 3: D ECISION T REES Prof. Julia Hockenmaier juliahmr@illinois.edu Announcements Office hours start

838 views • 45 slides
CHATTAHOOCHEE RIVER DISTRICT PUBLIC MEETING FOLLOW-UP 1 July 14 Public Information/Open

CHATTAHOOCHEE RIVER DISTRICT PUBLIC MEETING FOLLOW-UP 1 July 14 Public Information/Open

CHATTAHOOCHEE RIVER DISTRICT PUBLIC MEETING FOLLOW-UP 1 July 14 Public Information/Open House 2 3 July 14 August 3 Public Comment 4 July 14 August 3 Public Comment 5 July 14 Market Recap 6 July 14 August 3 Public

422 views • 13 slides
APPLI LICATION ON DOM OMAIN: N: SENS NSOR OR NE NETWOR ORKS KS SENSOR NETWORK AS A

APPLI LICATION ON DOM OMAIN: N: SENS NSOR OR NE NETWOR ORKS KS SENSOR NETWORK AS A

APPLI LICATION ON DOM OMAIN: N: SENS NSOR OR NE NETWOR ORKS KS SENSOR NETWORK AS A CONTROL SYSTEM Know everything - must deploy resources Know nothing - must deploy resources Data fusion, build prob. map of to maximize benefit from

444 views • 13 slides
Digital Transformation Adding value to the customer experience Chris Cherrett Digital Service

Digital Transformation Adding value to the customer experience Chris Cherrett Digital Service

Digital Transformation Adding value to the customer experience Chris Cherrett Digital Service &amp; User Experience Designer chrischerrett.uk hello@chrischerrett.uk @chrischerrett 3.64 Source: GWI, Feb 16 What is Digital Transformation?

631 views • 32 slides
VOTD: Time of Check, Time of Use Engineering Secure Software Last Revised: September 1, 2020

VOTD: Time of Check, Time of Use Engineering Secure Software Last Revised: September 1, 2020

VOTD: Time of Check, Time of Use Engineering Secure Software Last Revised: September 1, 2020 SWEN-331: Engineering Secure Software Benjamin S Meyers 1 What is Time of Check, Time of Use? Analogy: Jill asks Dan to have tea ready for her when

383 views • 7 slides
Syntac'c sugar : Syntax in a programming language that

Syntac'c sugar : Syntax in a programming language that

Syntac'c sugar : Syntax in a programming language that makes something easier to express. Example of syntac9c sugar int x = 1, y = 2; int

707 views • 13 slides
Distributional Semantics CMSC 470 Marine Carpuat Slides credit: Dan Jurafsky Reminders Read

Distributional Semantics CMSC 470 Marine Carpuat Slides credit: Dan Jurafsky Reminders Read

Words &amp; their Meaning: Distributional Semantics CMSC 470 Marine Carpuat Slides credit: Dan Jurafsky Reminders Read the syllabus Make sure you have access to piazza Get started on homework 1 due Wed Sep 5 by 11:59pm. Only

514 views • 37 slides
Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap

Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap

Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap Maxent models Basic neural language models Continuous representations Motivation Key idea: represent words with vectors Two common counting types

889 views • 60 slides

More recommend