The expression lemma [Ralph Lmmel, Ondrej Rypacek] Joo Vinagre - PowerPoint PPT Presentation

Mar 01, 2024 •223 likes •365 views

The expression lemma [Ralph Lmmel, Ondrej Rypacek] Joo Vinagre MAPi Thematic Seminar, June 2012 Outline 1. Introduction and motivation 2. Programming: Functional vs OO 3. Simple expression lemma 4. Generalized expression lemma 5.

The expression lemma [Ralph Lämmel, Ondrej Rypacek] João Vinagre MAPi Thematic Seminar, June 2012
Outline 1. Introduction and motivation 2. Programming: Functional vs OO 3. Simple expression lemma 4. Generalized expression lemma 5. Related work 6. Conclusions and future work 2
Introduction Problem Recursive Program OO paradigm Functional paradigm 3
Functional vs OO Recursive functions on Recursive methods on algebraic data type object state We know (by code inspection) that these two are semantically equivalent But can we prove it? (Mathematically!) 4
Algebras and coalgebras ● Functional programs: ● formalized in algebras of functional folds (catamorphisms) ● OO programs: ● formalized in coalgebras of object unfolds (anamorphisms) ● (Co)algebraic specification example (binary tree with labels): 5
Algebras and coalgebras ● Functional programs: ● formalized in algebras of functional folds (catamorphisms) ● OO programs: ● formalized in coalgebras of object unfolds (anamorphisms) ● (Co)algebraic specification example (binary tree with labels): 6
The expression lemma … defines a proper correspondence between anamorphically (and coalgebraically) phrased OO programs and catamorphically phrased functional programs. 7
Simple expression lemma Given a distributive law λ : FB → BF , we can define an arrow μF → νB using the derivations: 8
Generalized expression lemma ● Same reasoning, but lifts to monads and comonads ● Some additional properties need to be met Given a monad 〈 T, η,μ 〉 , a comonad 〈 D, η , δ 〉 and a distributive law Λ : TD → DT of the monad T over D : 9
Related work ● Functional OO programming languages ● Moby, .NET (C#/VB + LINQ), F#, Scala, OCaml, … ● Focus is on extending existing OO languages to support the functional paradigm (or vice-versa) ● However they do not try to establish a formal correspondence between OO and functional programs ● The expression problem [Wadler] ● Language code extensibility problem (both term- and operation-wise) ● Assumes the expression lemma, however with less structure 10
Related work (continued) ● Operational semantics [Turi and Plotkin] ● Denotational and operational semantics corresponds to functional and OO, respectively. ● Distributive laws ● Languages with binders in presheaf category [Fiore, Plotkin and Turi] ● Recursive constructs [Klin] ● Modular constructions on distributive laws [Jacobs] ● Distributive laws for recursion and corecursion [Pardo, Uustalu, Vene et al] 11
Conclusions ● Given: ● a recursive functional program expressed in catamorphisms (folds); ● a recursive OO program expressed in anamorphisms (unfolds); ● we can prove the semantic equivalence between both (if they are in fact equivalent) 12
Limitations / Open issues ● Not everything is linearly recursive! → a more general lemma is necessary for many real world problems ● Now that we can establish semantic equivalence, we should take advantage of this (e.g. bidirectional code refactoring) → not trivial 13
● 14

Recommend

Lec 03. Regular expression, Pumping lemma Eunjung Kim F ORMAL DEFINITION OF R EGULAR EXPRESSION

C OMPUTABILITY AND C OMPLEXITY , 2020 F ALL SEMESTER Lec 03. Regular expression, Pumping lemma Eunjung Kim F ORMAL DEFINITION OF R EGULAR EXPRESSION R EGULAR EXPRESSION OVER A FINITE ALPHABET Regular expression over is a string consisting

710 views • 13 slides

The Pumping Lemma for CFLs Statement Applications 1 Intuition Recall the pumping lemma

The Pumping Lemma for CFLs Statement Applications 1 Intuition Recall the pumping lemma for regular languages. It told us that if there was a string long enough to cause a cycle in the DFA for the language, then we could pump

475 views • 15 slides

More on Polyhedra and Farkas Lemma Marco Chiarandini Department of Mathematics & Computer

DM545 Linear and Integer Programming Lecture 8 More on Polyhedra and Farkas Lemma Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Farkas Lemma Outline Beyond the Simplex 1. Farkas Lemma 2.

304 views • 15 slides

Confluent Orthogonal Drawing for Syntax Diagrams S-expression ( S-expression

Confluent Orthogonal Drawing for Syntax Diagrams S-expression ( S-expression S-expression ) . AZ AZ 09 Michael J. Bannister David A. Brown David Eppstein Context-Free Grammars LISP 1.5 S-expression: (

486 views • 30 slides

Theory of Computer Science C4. Regular Languages: Pumping Lemma, Closure Properties and

Theory of Computer Science C4. Regular Languages: Pumping Lemma, Closure Properties and Decidability Gabriele R oger University of Basel March 30, 2020 Pumping Lemma Closure Properties Decidability Summary Pumping Lemma Pumping Lemma

1.16k views • 44 slides

Aggregation An aggregate function in the [columns] clause computes a value from a group of rows

Aggregate Functions So far, all SQL expressions have referred to the values in a single row at a time [expression] as [name], [expression] as [name], ... select [columns] from [table] where [expression] order by [expression]; Aggregation An

452 views • 4 slides

Gene Expression Data Introduction to gene expression data Expression data storage concept An

Gene Expression Data Introduction to gene expression data Expression data storage concept An example of storage and retrieval : CleanEx Online Analysis tools for gene expression data Outline - Gene expression measurements : from gene-scale to

700 views • 51 slides

The Expression Problem and Lenses Lambdajam 2016 Tony Morris The Expression Problem A new name

The Expression Problem and Lenses Lambdajam 2016 Tony Morris The Expression Problem A new name for an old problem[Wad98] Whether a language can solve the Expression Problem is a salient indicator of its capacity for expression. The Expression

894 views • 54 slides

0 . 16 c 0 p ( a ) P ( X a ) p ( a , y ) 0 0.16

The Questions of Our Time Life Gives You Lemmas, Make Lemma-nade! Y is a non-negative continuous random variable A lemma in the home or office is a good thing Probability Density Function: f Y ( y ) E [ Y ] P (

567 views • 3 slides

Schwarz lemma and boundary Schwarz lemma for pluriharmonic mappings Jian-Feng Zhu ( Huaqiao

) Schwarz lemma and boundary Schwarz lemma for pluriharmonic mappings Jian-Feng Zhu ( Huaqiao University, Xiamen, China flandy@hqu.edu.cn Report in the conference CAFT2018, University of Crete July 2, 2018 Jian-Feng Zhu

278 views • 15 slides

The pumping lemma Informatics 2A: Lecture 8 John Longley School of Informatics University of

Showing a language isnt regular The pumping lemma Applying the pumping lemma The pumping lemma Informatics 2A: Lecture 8 John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk 6 October, 2011 1 / 15 Showing a

281 views • 15 slides

The Pumping Lemma: limitations of regular languages Informatics 2A: Lecture 7 John Longley

Showing a language isnt regular The pumping lemma Applying the pumping lemma The Pumping Lemma: limitations of regular languages Informatics 2A: Lecture 7 John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk 6

186 views • 15 slides

Before We Start Any questions? The Pumping Lemma The Lemma & Decision/Closure Properties

Before We Start Any questions? The Pumping Lemma The Lemma & Decision/Closure Properties Languages Context Free Languages Future Exam Question Context Free Languages(CFL) is the next class of languages outside of Regular

634 views • 10 slides

The Poincar e Lemma for Codifferential Categories with Antiderivatives JS Pacaud Lemay CMS

The Poincar e Lemma for Codifferential Categories with Antiderivatives JS Pacaud Lemay CMS Summer 2019 Thanks to CMS for student funding support. Poincar e Lemma For an open subset U R n , let ( U ) be the de Rham complex of U

253 views • 23 slides

Example 1.73 I Lets apply pumping lemma to prove that B = { 0 n 1 n | n 0 } is not regular

Example 1.73 I Lets apply pumping lemma to prove that B = { 0 n 1 n | n 0 } is not regular Assume B is regular. From the lemma there is p such that s in the language with | s | p some properties hold September 23, 2020 1 / 9

240 views • 9 slides

The Pumping Lemma Definition: A language that cannot be defined by a regular expression is a

Chapter 10: Nonregular Languages Peter Cappello Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 cappello@cs.ucsb.edu The corresponding textbook chapter should be read before attending this

348 views • 14 slides

Regular Expression More conventionally called a pattern An expression that

Regular Expression More conventionally called a pattern An expression that describes a set of strings Gives a concise description of the set without listing all elements There are usually multiple regular expressions

817 views • 13 slides

Clustering Expression Data www.cs.washington.edu/527 Why cluster gene expression data?

Clustering Expression Data www.cs.washington.edu/527 Why cluster gene expression data? Tissue classification Find biologically related genes First step in inferring regulatory networks Look for common promoter elements

334 views • 10 slides

1.5 The Crossing-Lemma Averaging Technique Given a graph G = ( V, E ), let cr ( G ) denote the

1.5 The Crossing-Lemma Averaging Technique Given a graph G = ( V, E ), let cr ( G ) denote the crossing number The Crossing Lemma. of G , which is the minimum of the number of crossings of any embedding of G in R 2 . By definition, planar graphs

339 views • 4 slides

Randomness vs structure DNF compression and sunflower lemma Kewen Wu Peking University Joint

Overview DNF compression Sunflower lemma Open problems Thanks Randomness vs structure DNF compression and sunflower lemma Kewen Wu Peking University Joint works with Ryan Alweiss Shachar Lovett Jiapeng Zhang Princeton UCSD Harvard 1

267 views • 25 slides

U SE THE SSM AND GATING TREE TO GUIDE ANTIBODY - FLUOROCHROME PAIRINGS Assign bright markers

A NTIGEN C ATEGORIZATION Marker expression usually comes in three different patterns: On/Off expression, usually lineage markers (CD3, CD4, CD19) Intermediate or continuous expression patterns (CD45RA, CD38, CD57, cytokines, many more)

586 views • 15 slides

C4.1 Pumping Lemma Regular NFAs Languages Automata & Regular Formal Languages

Theory of Computer Science March 30, 2020 C4. Regular Languages: Pumping Lemma, Closure Properties and Decidability Theory of Computer Science C4. Regular Languages: Pumping Lemma, Closure Properties C4.1 Pumping Lemma and Decidability

282 views • 9 slides

Portable Higher Order Logic Proofs Joe Hurd and Rob Arthan Galois, Inc. and Lemma 1 Ltd.

Introduction Articles of Proof Theories Compressing Articles Summary Portable Higher Order Logic Proofs Joe Hurd and Rob Arthan Galois, Inc. and Lemma 1 Ltd. joe@galois.com and rda@lemma-one.com TEITP Workshop Wednesday 11 August 2010 Joe

565 views • 19 slides

On Computability and Learnability of the Pumping Lemma Function Dariusz Kaloci nski

On Computability and Learnability of the Pumping Lemma Function Dariusz Kaloci nski University of Warsaw, Poland March 11, 2014 8 th International Conference, LATA 2014 Structure what is the pumping lemma function? how complex is it?

659 views • 17 slides