-- Shakespeare, King John
Act IV, Scene II, Line 124
This is the next in the series of post on Dr. Graham Hutton's excellent paper, "A tutorial on the universality and expressiveness of fold", this time around we'll look at Oring. Dr. Hutton has given Oring the following definition:
or :: [Bool] → Bool
or = fold (∨) False
The idea is that we Fold an Or function with a seed value of False. If one of the members of the collection is True we Or it with False giving us True, else if none of the members of the collection are True we will end up with the value of False.
In the simple example below we'll see that if we have a single value of True then the end result will be True.
At the start we have a Seed value of False with collection containing False, True, and False.
Let us now look at this in sweet, sweet code.
In the Clojure code that we use the or macro and a seed value of false in order to create an Oring function using the higher order function of reduce. Since reduce is expecting a function and not a macro we need to create a lambda function to wrap the or macro.
We see in the C# code that we can use the LINQ aggregate method on the collection we are folding. We give the aggregate a seed value of false and in the lambda we simply takes the memorize and the current member and or them.
Using lodash's foldl function along with Babel.js we are able to create an Oring function by folding over the collection and passing it to a lambda function which ors the current member of the collection with the memorize value. We give a seed value of false thus causing the initial value of the memorize to be false.
There you have it an Oring function using nothing but Fold. Thus "proving" that all you need is Fold.
Act IV, Scene II, Line 124
Welcome Back
This is the next in the series of post on Dr. Graham Hutton's excellent paper, "A tutorial on the universality and expressiveness of fold", this time around we'll look at Oring. Dr. Hutton has given Oring the following definition:
or :: [Bool] → Bool
or = fold (∨) False
The idea is that we Fold an Or function with a seed value of False. If one of the members of the collection is True we Or it with False giving us True, else if none of the members of the collection are True we will end up with the value of False.
In the simple example below we'll see that if we have a single value of True then the end result will be True.
At the start we have a Seed value of False with collection containing False, True, and False.
First time the Memorize has False and X has False.
Second time the Memorize has False and X has True.
Third time the Memorize has True and X has False giving use the finally value of True.
Let us now look at this in sweet, sweet code.
Clojure
In the Clojure code that we use the or macro and a seed value of false in order to create an Oring function using the higher order function of reduce. Since reduce is expecting a function and not a macro we need to create a lambda function to wrap the or macro.
C#
We see in the C# code that we can use the LINQ aggregate method on the collection we are folding. We give the aggregate a seed value of false and in the lambda we simply takes the memorize and the current member and or them.
JavaScript (ECMAScript 2015)
Using lodash's foldl function along with Babel.js we are able to create an Oring function by folding over the collection and passing it to a lambda function which ors the current member of the collection with the memorize value. We give a seed value of false thus causing the initial value of the memorize to be false.
Until Next Time
There you have it an Oring function using nothing but Fold. Thus "proving" that all you need is Fold.
