matching lenses
play

Matching Lenses Davi M. J. Barbosa (Polytechnique) Julien Cretin - PowerPoint PPT Presentation

Feb 07, 2023 •430 likes •930 views

Matching Lenses Davi M. J. Barbosa (Polytechnique) Julien Cretin (Polytechnique/INRIA) Nate Foster (Cornell) Michael Greenberg (Penn) Benjamin C. Pierce (Penn) ICFP 10 Example =History (5 pts)= List the inventors of the following

  1. Matching Lenses Davi M. J. Barbosa (Polytechnique) Julien Cretin (Polytechnique/INRIA) Nate Foster (Cornell) Michael Greenberg (Penn) Benjamin C. Pierce (Penn) ICFP ’10

  2. Example =History (5 pts)= List the inventors of the following programming languages. * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *) =Scoping (2 pts)= Which of these terms are closed? * ń x. ń y.x (* Yes *) * ( ń x. ń z.x) ń x. ń y.z (* No *) =Lambda Calculus (3 pts)= Give a weakly normalizing term which is not strongly normalizing. (* ( ń x. ń y.y) (( ń x.x x) ń x.x x) *)

  3. Example =History (5 pts)= =History= List the inventors of the List the inventors of the following programming languages. following programming languages. * Haskell 98 (* Hudak,PJ,Wadler *) * Haskell 98 * LISP 58 (* McCarthy *) * LISP 58 * ML 73 (* Gordon,Milner *) * ML 73 =Scoping (2 pts)= =Scoping= Which of these terms are closed? Which of these terms are closed? * ń x. ń y.x * ń x. ń y.x (* Yes *) * ( ń x. ń z.x) ń x. ń y.z * ( ń x. ń z.x) ń x. ń y.z (* No *) =Lambda Calculus= =Lambda Calculus (3 pts)= Give a weakly normalizing term Give a weakly normalizing term which is not strongly normalizing. which is not strongly normalizing. (* ( ń x. ń y.y) (( ń x.x x) ń x.x x) *)

  4. Example =History (5 pts)= =History= List the inventors of the List the inventors of the =History= following programming languages. following programming languages. List the inventors of the * Haskell 98 (* Hudak,PJ,Wadler *) * Haskell 98 following programming languages. * LISP 58 (* McCarthy *) * LISP 58 * LISP 58 * ML 73 (* Gordon,Milner *) * ML 73 * ML 73 =Scoping (2 pts)= =Scoping= * OCaml 87 Which of these terms are closed? Which of these terms are closed? * Haskell 90 * ń x. ń y.x * ń x. ń y.x (* Yes *) =Combinators= * ( ń x. ń z.x) ń x. ń y.z * ( ń x. ń z.x) ń x. ń y.z (* No *) Give the equations for S and K in =Lambda Calculus= =Lambda Calculus (3 pts)= a combinatory algebra. Give a weakly normalizing term Give a weakly normalizing term =Scoping= which is not strongly normalizing. which is not strongly normalizing. Which of these terms are closed? (* ( ń x. ń y.y) (( ń x.x x) ń x.x x) *) * ń x. ń y.x * ń x.( ń y.y) y * ( ń x. ń z.x) ń x. ń y.z =Lambda Calculus= Give a weakly normalizing term which is not strongly normalizing.

  5. Example =History (5 pts)= =History= List the inventors of the List the inventors of the =History (5 pts)= =History= following programming languages. following programming languages. List the inventors of the List the inventors of the * Haskell 98 (* Hudak,PJ,Wadler *) * Haskell 98 following programming languages. following programming languages. * LISP 58 (* McCarthy *) * LISP 58 * LISP 58 (* McCarthy *) * LISP 58 * ML 73 (* Gordon,Milner *) * ML 73 * ML 73 (* Gordon,Milner *) * ML 73 =Scoping (2 pts)= =Scoping= * OCaml 87 (* TODO: answer *) * OCaml 87 Which of these terms are closed? Which of these terms are closed? * Haskell 90 (* Hudak,PJ,Wadler *) * Haskell 90 * ń x. ń y.x * ń x. ń y.x (* Yes *) =Combinators (? pts)= =Combinators= * ( ń x. ń z.x) ń x. ń y.z * ( ń x. ń z.x) ń x. ń y.z (* No *) Give the equations for S and K in Give the equations for S and K in =Lambda Calculus= =Lambda Calculus (3 pts)= a combinatory algebra. a combinatory algebra. Give a weakly normalizing term Give a weakly normalizing term (* TODO: write the answer *) =Scoping= which is not strongly normalizing. which is not strongly normalizing. =Scoping (2 pts)= Which of these terms are closed? (* ( ń x. ń y.y) (( ń x.x x) ń x.x x) *) * ń x. ń y.x Which of these terms are closed? * ń x.( ń y.y) y * ń x. ń y.x (* Yes *) * ( ń x. ń z.x) ń x. ń y.z * ń x.( ń y.y) y (* TODO: answer *) =Lambda Calculus= * ( ń x. ń z.x) ń x. ń y.z (* No *) Give a weakly normalizing term =Lambda Calculus (3 pts)= which is not strongly normalizing. Give a weakly normalizing term which is not strongly normalizing. (* ( ń x. ń y.y) (( ń x.x x) ń x.x x) *)

  6. Example =History (5 pts)= =History= List the inventors of the List the inventors of the following programming languages. following programming languages. * LISP 58 (* McCarthy *) * LISP 58 * ML 73 (* Gordon,Milner *) * ML 73 * OCaml 87 (* TODO: answer *) * OCaml 87 * Haskell 90 (* Hudak,PJ,Wadler *) * Haskell 90 =Combinators (? pts)= =History (5 pts)= =Combinators= Give the equations for S and K in * Haskell 98 (* Hudak,PJ,Wadler *) Give the equations for S and K in a combinatory algebra. a combinatory algebra. * LISP 58 (* McCarthy *) (* TODO: write the answer *) =Scoping= * ML 73 (* Gordon,Milner *) =Scoping (2 pts)= Which of these terms are closed? * ń x. ń y.x Which of these terms are closed? * ń x.( ń y.y) y * ń x. ń y.x (* Yes *) * ( ń x. ń z.x) ń x. ń y.z * ń x.( ń y.y) y (* TODO: answer *) =Lambda Calculus= * ( ń x. ń z.x) ń x. ń y.z (* No *) Give a weakly normalizing term =Lambda Calculus (3 pts)= which is not strongly normalizing. Give a weakly normalizing term which is not strongly normalizing. (* ( ń x. ń y.y) (( ń x.x x) ń x.x x) *)

  7. Basic lens with complement A lens l is between a source set S and a view set V , and over a complement set C . C Notation: l ∈ S ⇐ ⇒ V

  8. Basic lens with complement A lens l is between a source set S and a view set V , and over a complement set C . C Notation: l ∈ S ⇐ ⇒ V The source S contains all the information (the full exam). =History (5 pts)= * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *)

  9. Basic lens with complement A lens l is between a source set S and a view set V , and over a complement set C . C Notation: l ∈ S ⇐ ⇒ V The view V has less information than the source (we don’t show the answers and number of points). =History= * Haskell 98 * LISP 58 * ML 73

  10. Basic lens with complement A lens l is between a source set S and a view set V , and over a complement set C . C Notation: l ∈ S ⇐ ⇒ V The complement C represents the missing information (the answers and number of points). Hudak,PJ,Wadler McCarthy 5 pts Gordon,Milner

  11. Basic lens with complement A lens comes with three functions: get, =History (5 pts)= * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *) get =History= * Haskell 98 * LISP 58 * ML 73

  12. Basic lens with complement A lens comes with three functions: get, res =History (5 pts)= * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *) res 5 pts Hudak,PJ,Wadler McCarthy Gordon,Milner

  13. Basic lens with complement A lens comes with three functions: get, res and put. =History (5 pts)= * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *) put 5 pts =History= Hudak,PJ,Wadler * Haskell 98 McCarthy * LISP 58 Gordon,Milner * ML 73

  14. Basic lens with complement l . get ∈ S → V ∈ S → C l . res l . put ∈ V → C → S These functions obey two round-tripping laws, explaining the interoperation between get, res and put. l . get ( l . put v c ) = v ( PutGet ) l . put ( l . get s ) ( l . res s ) = s ( GetPut )

  15. The alignment problem =History (5 pts)= * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *)

  16. The alignment problem =History (5 pts)= * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *) get =History= * Haskell 98 * LISP 58 * ML 73

  17. The alignment problem =History (5 pts)= * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *) get =History= =History= * LISP 58 * Haskell 98 * ML 73 * LISP 58 * OCaml 87 * ML 73 * Haskell 90 edit

  18. The alignment problem =History (5 pts)= =History (5 pts)= * LISP 58 (* Hudak,PJ,Wadler *) * Haskell 98 (* Hudak,PJ,Wadler *) * ML 73 (* McCarthy *) * LISP 58 (* McCarthy *) * OCaml 87 (* Gordon,Milner *) * ML 73 (* Gordon,Milner *) * Haskell 90 (* TODO: answer *) get put =History= =History= * LISP 58 * Haskell 98 * ML 73 * LISP 58 * OCaml 87 * ML 73 * Haskell 90 edit

  19. Challenges ◮ This problem is fundamentally heuristic ◮ “state-based” lens only sees the result of edit ◮ user intent must be inferred ◮ Appropriate heuristic depends on the application ◮ How to fit these heuristic behaviors into our principled lens framework? ◮ how to formulate clean semantic laws involving “user intent”?

  20. Matching Lenses Goals: ◮ General solution (applicable to many heuristics) ◮ Clean theory (core laws parametrized on heuristics)

  21. Structures with chunks In order to express the behavior of the put function in presence of view edits, we need to add structure to the source, view and complement types. =History (5 pts)= source * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) chunks * ML 73 (* Gordon,Milner *) whole complement view resource =History= rigid complement Hudak,PJ,Wadler * Haskell 98 5 pts * LISP 58 McCarthy * ML 73 Gordon,Milner

  22. Plan ◮ Start with something simple ◮ get does not permute the items ◮ items are not nested ◮ only one sublens is used for all items ◮ Understand it fully ◮ Relax these simplifications

  23. Simple matching lenses

  24. Mechanism =History (5 pts)= * Haskell 98 (* Hudak,PJ,Wadler *) * LISP 58 (* McCarthy *) * ML 73 (* Gordon,Milner *)

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

Thin Lenses Thick Lenses Paraxial approximation ( ) ( ) sin tan ( )

Thin Lenses Thick Lenses Paraxial approximation ( ) ( ) sin tan ( )

Thin Lenses Thick Lenses Paraxial approximation ( ) ( ) sin tan ( ) cos 1 See Hecht Ch. 5 and review the following Equations. Refer to lecture given on 10/01 for derivation of the following equations 1

176 views • 13 slides
1 Converging Lenses Biconvex lens Planoconvex lens Positive meniscus lens Oct 289:56 AM

1 Converging Lenses Biconvex lens Planoconvex lens Positive meniscus lens Oct 289:56 AM

Lenses 2 types converging and diverging Oct 289:52 AM Converging Lenses rays that are parallel to the principal axis, strike the lens, and converge to a single point on the opposite side of the lens (they pass through 2 surfaces) Oct

703 views • 10 slides
7.5 Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E

7.5 Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E

7.5 Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E is a matching if each node appears in at most edge in M. Max matching: find a max cardinality matching. 3 Bipartite Matching Bipartite matching.

542 views • 37 slides
Symmetric lenses and universality Bob Rosebrugh (with Michael Johnson) Department of Mathematics

Symmetric lenses and universality Bob Rosebrugh (with Michael Johnson) Department of Mathematics

Symmetric lenses and universality Bob Rosebrugh (with Michael Johnson) Department of Mathematics and Computer Science Mount Allison University CT 2017 / 2017-07-22 Outline Lenses: symmetric and asymmetric Cospans and symmetric lenses

554 views • 37 slides
LENSES INEL 6088 Computer Vision LENSES The function of the lens is to collect more light

LENSES INEL 6088 Computer Vision LENSES The function of the lens is to collect more light

LENSES INEL 6088 Computer Vision LENSES The function of the lens is to collect more light Image sensor size determines camera format Lens should be chosen so that all features to be measured are covered in the image sensor, plus 10%

476 views • 26 slides
Self De-icing LED Signals OPPORTUNITY PROBLEM Existing LED traffic light lenses are

Self De-icing LED Signals OPPORTUNITY PROBLEM Existing LED traffic light lenses are

Self De-icing LED Signals OPPORTUNITY PROBLEM Existing LED traffic light lenses are unheated- snow and ice accumulation on the lenses Incandescent lamps melt ice but not energy inefficient SOLUTION KU technology

78 views • 7 slides
Compound Light Microscope Light & glass lenses used to magnify objects Eyepiece 10X

Compound Light Microscope Light & glass lenses used to magnify objects Eyepiece 10X

Compound Light Microscope Light & glass lenses used to magnify objects Eyepiece 10X Objective lenses: 4x,10x, 40x Up to 2000x Resolution Ability of microscope to show fine detail Wet Mounts Cover slips: protect lens from water,

508 views • 17 slides
REFRACTIVE X-RAY LENSES NEW DEVELOPMENTS BRUNO LENGELER PHYSICS DEPARTMENT RWTH AACHEN

REFRACTIVE X-RAY LENSES NEW DEVELOPMENTS BRUNO LENGELER PHYSICS DEPARTMENT RWTH AACHEN

REFRACTIVE X-RAY LENSES NEW DEVELOPMENTS BRUNO LENGELER PHYSICS DEPARTMENT RWTH AACHEN UNIVERSITY (Grenoble, July 2010) 1 A. Strategy for refractive x-ray lenses > have been considered as not feasible for a long time n = 1 +

829 views • 63 slides
X u a u a a matching. 3 3 3 0 0 1 dashed means matched. Algorithm No augmenting path

X u a u a a matching. 3 3 3 0 0 1 dashed means matched. Algorithm No augmenting path

Comments on last lecture. Today Matching/Weighted Vertex Cover Maximum Weight Matching. Given a bipartite graph, G = ( U , V , E ) , with edge weights w : E R , find a maximum weight matching. Easy to come up with several Nash for

181 views • 4 slides
Superconducting Solenoid-Based Focusing Lenses for HINS Linac I. Terechkine AAC Meeting

Superconducting Solenoid-Based Focusing Lenses for HINS Linac I. Terechkine AAC Meeting

Superconducting Solenoid-Based Focusing Lenses for HINS Linac I. Terechkine AAC Meeting November 16-17, 2009 Outline Basics of solenoid focusing, requirements, and R&D structure RT section lens S/C sections lenses

484 views • 21 slides
Draft Internal lenses as monad morphisms Bryce Clarke CoACT, Macquarie University,

Draft Internal lenses as monad morphisms Bryce Clarke CoACT, Macquarie University,

Draft Internal lenses as monad morphisms Bryce Clarke CoACT, Macquarie University, bryce.clarke1@students.mq.edu.au CT2019, July 12 Draft Outline Motivation Formal monads, functors, and cofunctors The 2-category of internal lenses Bonus:

462 views • 30 slides
Bundles, Lenses & Machine Learning Motivation Backprop as Functor Jules Hedges 1 Bundles

Bundles, Lenses & Machine Learning Motivation Backprop as Functor Jules Hedges 1 Bundles

Bundles, Lenses & Machine Learning Bundles, Lenses & Machine Learning Motivation Backprop as Functor Jules Hedges 1 Bundles Putting it joint work with together Brendan Fong 2 Eliana Lorch 3 David Spivak 2 1 Max Planck Institute

1.03k views • 79 slides
Outline Morning program Preliminaries Text matching I Text matching II Afternoon program

Outline Morning program Preliminaries Text matching I Text matching II Afternoon program

Outline Morning program Preliminaries Text matching I Text matching II Afternoon program Learning to rank Modeling user behavior Generating responses Wrap up 49 Text matching I Supervised text matching Traditional IR data consists of

370 views • 26 slides
Matching of Matrix Elements and Parton Showers CKKW matching in e + e collisions Lecture 2:

Matching of Matrix Elements and Parton Showers CKKW matching in e + e collisions Lecture 2:

Lecture 2: Matching in e + e collisions Why Matching? Present matching approaches Matching of Matrix Elements and Parton Showers CKKW matching in e + e collisions Lecture 2: Matching in e + e collisions The MLM procedure Johan

610 views • 29 slides
Global Shape Matching Section 3.3: Articulated Matching using Graph Cuts Global Shape Matching:

Global Shape Matching Section 3.3: Articulated Matching using Graph Cuts Global Shape Matching:

Global Shape Matching Section 3.3: Articulated Matching using Graph Cuts Global Shape Matching: Extrinsic Key Point Detection and Feature Descriptors 1 1 Articulated Shape Matching Feature-based matching alone is not enough to find

413 views • 25 slides
Introduction Model-driven development is fashionable. But what is it? Whats a model? Lets

Introduction Model-driven development is fashionable. But what is it? Whats a model? Lets

Plan 1. Bidirectional model transformations Towards an algebraic theory of bidirectional 2. What is sanity? transformations 3. A special case: lenses 4. Algebra of lenses beginnings! Perdita Stevens 5. Open issues and conclusions

416 views • 14 slides
- Stable Matching - Kidney Exchange [Slides : Ariel D. Procaccia] CSC2556 - Nisarg Shah 1

- Stable Matching - Kidney Exchange [Slides : Ariel D. Procaccia] CSC2556 - Nisarg Shah 1

CSC2556 Lecture 5 Matching - Stable Matching - Kidney Exchange [Slides : Ariel D. Procaccia] CSC2556 - Nisarg Shah 1 Announcements The assignment is up! It is complete, and no more questions will be added. After todays class,

1.18k views • 50 slides
CSCI 5832 Natural Language Processing Jim Martin Lecture 17 3/13/08 1 Today 3/13

CSCI 5832 Natural Language Processing Jim Martin Lecture 17 3/13/08 1 Today 3/13

CSCI 5832 Natural Language Processing Jim Martin Lecture 17 3/13/08 1 Today 3/13 Statistical Parsing 2 3/13/08 Example 3 3/13/08 1 Probabilistic CFGs The probabilistic model Assigning probabilities to parse trees

579 views • 13 slides
Random Matrices and Zeros of Polynomials Guilherme Silva Joint work with Pavel Bleher (IUPUI)

Random Matrices and Zeros of Polynomials Guilherme Silva Joint work with Pavel Bleher (IUPUI)

Random Matrices and Zeros of Polynomials Guilherme Silva Joint work with Pavel Bleher (IUPUI) [Memoirs of the AMS, to appear] Guilherme Silva RMT and zeros of pols Our interest today M random matrix size N N Guilherme Silva RMT and zeros

1.04k views • 72 slides
L EMMA 1.1 In each (square) case the Lebesgue measure is invariant under conjugation : d M = d (

L EMMA 1.1 In each (square) case the Lebesgue measure is invariant under conjugation : d M = d (

RM RH AND OP S A SYMPTOTICS P OT . T H . DZ A N INTRODUCTION TO R ANDOM M ATRICES AND THE D EIFT -Z HOU STEEPEST DESCENT APPROACH TO ASYMPTOTICS OF O RTHOGONAL P OLYNOMIALS Marco Bertola, Dep. Mathematics and Statistics, Concordia University

653 views • 34 slides
EECS 495 Geospatial Vision and Visualization Assignment 2 Map Matching and Slope Prediction

EECS 495 Geospatial Vision and Visualization Assignment 2 Map Matching and Slope Prediction

EECS 495 Geospatial Vision and Visualization Assignment 2 Map Matching and Slope Prediction Nick Paras | Kapil Garg Outline 1. Exploratory Data Analysis 2. Map Matching Methodology a. Point to Link b. Point to Link with Heading c.

708 views • 31 slides
(Probably) Concave Graph Matching Haggai Maron and Yaron Lipman Weizmann Institute of Science

(Probably) Concave Graph Matching Haggai Maron and Yaron Lipman Weizmann Institute of Science

(Probably) Concave Graph Matching Haggai Maron and Yaron Lipman Weizmann Institute of Science Graph Matching n tr( ) min Graph Matching n tr( ) min DS Previous Work

621 views • 17 slides
Representation of Games 14.12 Game Theory Muhamet Yildiz 1 Game: Ingredients Who are the

Representation of Games 14.12 Game Theory Muhamet Yildiz 1 Game: Ingredients Who are the

Lecture 3 Representation of Games 14.12 Game Theory Muhamet Yildiz 1 Game: Ingredients Who are the players (decision makers)? What moves are available to each player and when? What does each player know at the time of each of his

703 views • 26 slides
Overview Weaknesses of NE 1 Example 1: Centipede Game Example 2: Matching Pennies Logit QRE 2

Overview Weaknesses of NE 1 Example 1: Centipede Game Example 2: Matching Pennies Logit QRE 2

Overview Weaknesses of NE 1 Example 1: Centipede Game Example 2: Matching Pennies Logit QRE 2 Explaining the Centipede Game using logit-QRE Explaining Matching Pennies using Logit QRE Impulse Balance Equilibrium 3 Action-Sampling

812 views • 46 slides

More recommend