Folding Cheat Sheet #1 - first in a series

•

0 gefällt mir•15 views

Philip Schwarz

Folding over recursively defined data structures for natural numbers and lists.

Software

CHEAT-SHEET
Folding
#1
∶
/
𝒂𝟎 ∶
/
𝒂𝟏 ∶
/
𝒂𝟐 ∶
/
𝒂𝟑
𝒇
/
𝒂𝟎 𝒇
/
𝒂𝟏 𝒇
/
𝒂𝟐 𝒇
/
𝒂𝟑 𝒆
@philip_schwarz
slides by https://fpilluminated.com/

𝐝𝐚𝐭𝐚 𝑵𝒂𝒕 = 𝒁𝒆𝒓𝒐 | 𝑺𝒖𝒄𝒄 𝑵𝒂𝒕 𝐝𝐚𝐭𝐚 𝑳𝒊𝒔𝒕 α = 𝑵𝒊𝒍 | 𝑪𝒐𝒏𝒔 α (𝑳𝒊𝒔𝒕 α)
𝑓 :: 𝑵𝒂𝒕 → 𝛼
𝑓 𝒁𝒆𝒓𝒐 = 𝑐
𝑓 𝑺𝒖𝒄𝒄 𝑛 = ℎ 𝑓 𝑛
𝑓𝑜𝑙𝑑𝑛 ∷ 𝛼 → 𝛼 → 𝛼 → 𝑵𝒂𝒕 → 𝛼
𝑓𝑜𝑙𝑑𝑛 ℎ 𝑐 𝒁𝒆𝒓𝒐 = 𝑐
𝑓𝑜𝑙𝑑𝑛 ℎ 𝑐 𝑺𝒖𝒄𝒄 𝑛 = ℎ 𝑓𝑜𝑙𝑑𝑛 ℎ 𝑐 𝑛
𝑚 + 𝑛 = 𝑓𝑜𝑙𝑑𝑛 𝑺𝒖𝒄𝒄 𝑚 𝑛
𝑚 × 𝑛 = 𝑓𝑜𝑙𝑑𝑛 𝜆𝑥. 𝑥 + 𝑚 𝒁𝒆𝒓𝒐 𝑛
𝑚 ↑ 𝑛 = 𝑓𝑜𝑙𝑑𝑛 𝜆𝑥. 𝑥 × 𝑚 𝑺𝒖𝒄𝒄 𝒁𝒆𝒓𝒐 𝑛
+ ∷ 𝑵𝒂𝒕 → 𝑵𝒂𝒕 → 𝑵𝒂𝒕
𝑚 + 𝒁𝒆𝒓𝒐 = 𝑚
𝑚 + 𝑺𝒖𝒄𝒄 𝑛 = 𝑺𝒖𝒄𝒄 𝑚 + 𝑛
(×) ∷ 𝑵𝒂𝒕 → 𝑵𝒂𝒕 → 𝑵𝒂𝒕
𝑚 × 𝒁𝒆𝒓𝒐 = 𝒁𝒆𝒓𝒐
𝑚 × 𝑺𝒖𝒄𝒄 𝑛 = 𝑚 × 𝑛 + 𝑚
(↑) ∷ 𝑵𝒂𝒕 → 𝑵𝒂𝒕 → 𝑵𝒂𝒕
𝑚 ↑ 𝒁𝒆𝒓𝒐 = 𝑺𝒖𝒄𝒄 𝒁𝒆𝒓𝒐
𝑚 ↑ 𝑺𝒖𝒄𝒄 𝑛 = 𝑚 ↑ 𝑛 × 𝑚
𝑓𝑜𝑙𝑑𝑟 ∷ 𝛼 → 𝛽 → 𝛽 → 𝛽 → 𝛼 → 𝛽
𝑓𝑜𝑙𝑑𝑟 𝑓 𝑏 𝑵𝒊𝒍 = 𝑏
𝑓𝑜𝑙𝑑𝑟 𝑓 𝑏 (𝑪𝒐𝒏𝒔 𝑥 𝑥𝑠) = 𝑓 𝑥 𝑓𝑜𝑙𝑑𝑟 𝑓 𝑏 𝑥𝑠
𝑓 :: 𝑳𝒊𝒔𝒕 𝛼 → 𝛽
𝑓 𝑵𝒊𝒍 = 𝑐
𝑓 𝑪𝒐𝒏𝒔 𝑥 𝑥𝑠 = ℎ 𝑥 (𝑓 𝑥𝑠)
𝑠𝑢𝑚 ∷ 𝑳𝒊𝒔𝒕 𝑵𝒂𝒕 → 𝑵𝒂𝒕
𝑠𝑢𝑚 𝑵𝒊𝒍 = 𝒁𝒆𝒓𝒐
𝑠𝑢𝑚 𝑪𝒐𝒏𝒔 𝑥 𝑥𝑠 = 𝑥 + (𝑠𝑢𝑚 𝑥𝑠)
𝑎𝑝𝑝𝑒𝑛𝑑 ∷ 𝑳𝒊𝒔𝒕 𝛼 → 𝑳𝒊𝒔𝒕 𝛼 → 𝑳𝒊𝒔𝒕 𝛼
𝑎𝑝𝑝𝑒𝑛𝑑 𝑵𝒊𝒍 𝑦𝑠 = 𝑦𝑠
𝑎𝑝𝑝𝑒𝑛𝑑 𝑪𝒐𝒏𝒔 𝑥 𝑥𝑠 𝑦𝑠 = 𝑪𝒐𝒏𝒔 𝑥 (𝑎𝑝𝑝𝑒𝑛𝑑 𝑥𝑠 𝑦𝑠)
𝑙𝑒𝑛𝑔𝑡ℎ ∷ 𝑳𝒊𝒔𝒕 𝛼 → 𝑵𝒂𝒕
𝑙𝑒𝑛𝑔𝑡ℎ 𝑵𝒊𝒍 = 𝒁𝒆𝒓𝒐
𝑙𝑒𝑛𝑔𝑡ℎ 𝑪𝒐𝒏𝒔 𝑥 𝑥𝑠 = 𝑺𝒖𝒄𝒄 𝒁𝒆𝒓𝒐 + (𝑙𝑒𝑛𝑔𝑡ℎ 𝑥𝑠)
𝑠𝑢𝑚 𝑥𝑠 = 𝑓𝑜𝑙𝑑𝑟 + 𝒁𝒆𝒓𝒐 𝑥𝑠
𝑙𝑒𝑛𝑔𝑡ℎ 𝑥𝑠 = 𝑓𝑜𝑙𝑑𝑟 𝜆𝑥. 𝜆𝑛. 𝑛 + 𝑺𝒖𝒄𝒄 𝒁𝒆𝒓𝒐 𝒁𝒆𝒓𝒐 𝑥𝑠
𝑎𝑝𝑝𝑒𝑛𝑑 𝑥𝑠 𝑦𝑠 = 𝑓𝑜𝑙𝑑𝑟 𝑪𝒐𝒏𝒔 𝑦𝑠 𝑥𝑠
Common pattern for many recursive functions over 𝑵𝒂𝒕 : Common pattern for many recursive functions over 𝑳𝒊𝒔𝒕:
𝑐 :: 𝛼
ℎ :: 𝛼 → 𝛼
𝑐 :: 𝛽
ℎ :: 𝛼 → 𝛽
Three examples of such functions: Three examples of such functions:
The common pattern can be captured in a function: The common pattern can be captured in a function:
The three sample functions implemented using 𝑓𝑜𝑙𝑑𝑛: The three sample functions implemented using 𝑓𝑜𝑙𝑑𝑟:

Weitere ähnliche Inhalte

Ähnlich wie Folding Cheat Sheet #1 - first in a series

Folding Cheat Sheet #2 - second in a series

Philip Schwarz

Folding Cheat Sheet #2 - second in a series

Philip Schwarz

Sets

Fightgood Allmyheart

Photosynthesis

VedantPatel100

Instrumental Variables

MEASURE Evaluation

SUEC 高中 Adv Maths (Irrational Part 3)

tungwc

Review of generative adversarial nets

SungminYou

07.mdsd_modelado_termicos_liquidos

Hipólito Aguilar

On ranges and null spaces of a special type of operator named 𝝀 − 𝒋𝒆𝒄𝒕𝒊𝒐𝒏. – ...

IJMER

Enzymes

VedantPatel100

SUEC 高中 Adv Maths (Biquadratic Equation, Method of Changing the Variable, Rec...

tungwc

Ch 5 integration

samirlakhanistb

Integration

Amit Chaudhary

SUEC 高中 Adv Maths (Quadratic Equation in One Variable)

tungwc

Carbohydrate Metabolism

VedantPatel100

Blow up in a degenerate keller--segel system(Eng.)

Takahiro Hashira

2018 Geometri Transformasi Perkalian 5 Isometri Kelompok 8 Rombel 3

Yosia Adi Setiawan

05.mdsd_modelado_mecanico_electrico

Hipólito Aguilar

Teoria Numérica (Palestra 01)

Eugenio Souza

This webinar by Peter Lance considered impact evaluation estimation methods based on an identification strategy that assumes we can observe all factors that influence both program participation and the outcome of interest. It was the third webinar in a series of discussions on the popular MEASURE Evaluation manual, How Do We Know If a Program Made a Difference? A Guide to Statistical Methods for Program Impact Evaluation.

Selection on Observables

MEASURE Evaluation

Ähnlich wie Folding Cheat Sheet #1 - first in a series (20)

Folding Cheat Sheet #2 - second in a series

Sets

Photosynthesis

Instrumental Variables

SUEC 高中 Adv Maths (Irrational Part 3)

Review of generative adversarial nets

07.mdsd_modelado_termicos_liquidos

On ranges and null spaces of a special type of operator named 𝝀 − 𝒋𝒆𝒄𝒕𝒊𝒐𝒏. – ...

Enzymes

SUEC 高中 Adv Maths (Biquadratic Equation, Method of Changing the Variable, Rec...

Ch 5 integration

Integration

SUEC 高中 Adv Maths (Quadratic Equation in One Variable)

Carbohydrate Metabolism

Blow up in a degenerate keller--segel system(Eng.)

2018 Geometri Transformasi Perkalian 5 Isometri Kelompok 8 Rombel 3

05.mdsd_modelado_mecanico_electrico

Teoria Numérica (Palestra 01)

Selection on Observables

Mehr von Philip Schwarz

Direct Style Effect Systems -The Print[A] Example- A Comprehension Aid

Philip Schwarz

Folding Cheat Sheet #4 - fourth in a series

Philip Schwarz

Scala Left Fold Parallelisation- Three Approaches

Philip Schwarz

Tagless Final Encoding - Algebras and Interpreters and also Programs

Philip Schwarz

Fusing Transformations of Strict Scala Collections with Views

Philip Schwarz

A sighting of traverse_ function in Practical FP in Scala

Philip Schwarz

A sighting of traverseFilter and foldMap in Practical FP in Scala

Philip Schwarz

A sighting of sequence function in Practical FP in Scala

Philip Schwarz

This talk was presented on Aug 3rd 2023 during the Scala in the City event a ITV in London https://www.meetup.com/scala-in-the-city/events/292844968/ Visit the following for a description, slideshow, all slides with transcript, pdf, github repo, and eventually a video recording: http://fpilluminated.com/assets/n-queens-combinatorial-puzzle-meets-cats.html At the centre of this talk is the N-Queens combinatorial puzzle. The reason why this puzzle features in the Scala book and functional programming course by Martin Odersky (the language’s creator), is that such puzzles are a particularly suitable application area of 'for comprehensions'. We’ll start by (re)acquainting ourselves with the puzzle, and seeing the role played in it by permutations. Next, we’ll see how, when wanting to visualise candidate puzzle solutions, Cats’ monoidal functions fold and foldMap are a great fit for combining images. While we are all very familiar with the triad providing the bread, butter and jam of functional programming, i.e. map, filter and fold, not everyone knows about the corresponding functions in Cats’ monadic variant of the triad, i.e. mapM, filterM and foldM, which we are going to learn about next. As is often the case in functional programming, the traverse function makes an appearance, and we shall grab the opportunity to point out the symmetry that exists in the interrelation of flatMap / foldMap / traverse and flatten / fold / sequence. Armed with an understanding of foldM, we then look at how such a function can be used to implement an iterative algorithm for the N-Queens puzzle. The talk ends by pointing out that the iterative algorithm is smarter than the recursive one, because it ‘remembers’ where it has already placed previous queens.

N-Queens Combinatorial Puzzle meets Cats

Philip Schwarz

Kleisli composition, flatMap, join, map, unit - implementation and interrelat...

Philip Schwarz

The aggregate function - from sequential and parallel folds to parallel aggre...

Philip Schwarz

Nat, List and Option Monoids -from scratch -Combining and Folding -an example

Philip Schwarz

Nat, List and Option Monoids -from scratch -Combining and Folding -an example

Philip Schwarz

When I posted the deck for Part 1 to the Scala users forum, Odd Möller linked to a paper titled "The Genuine Sieve of Eratosthenes", which speaks of the Unfaithful Sieve. Part 2 is based on that paper and on Richard Bird's faithful Haskell implementation of the Sieve, which we translate into Scala. Scala code for Richard Bird's infinite primes Haskell program: https://github.com/philipschwarz/sieve-of-eratosthenes-part-2-scala

The Sieve of Eratosthenes - Part II - Genuine versus Unfaithful Sieve - Haske...

Philip Schwarz

Sum and Product Types -The Fruit Salad & Fruit Snack Example - From F# to Ha...

Philip Schwarz

Algebraic Data Types forData Oriented Programming - From Haskell and Scala t...

Philip Schwarz

Jordan Peterson - The pursuit of meaning and related ethical axioms

Philip Schwarz

Defining filter using (a) recursion (b) folding (c) folding with S, B and I c...

Philip Schwarz

Defining filter using (a) recursion (b) folding with S, B and I combinators (...

Philip Schwarz

The Sieve of Eratosthenes - Part 1 - with minor corrections

Philip Schwarz

Mehr von Philip Schwarz (20)