About CTA slice

From the About page, a call-to-action section, available on all pages now.

FAQ section from the About page

Titles are Rich Text as well, so they are SEO-friendly, if you wish

Don't know whether it's important for FAQ sections, though.

Hero from the About page. Note that the featured video is a direct URL to a Wistia video content.

Addidional underline

About Us section from the About page

And there could be a lot of topics here

With Rich Text as the content. Topic Titles are Rich Text as well.

About Team slice

With an additional subtitle

Human Resource #1

Human Resource #2

About Videos Path slice

This is a customizable subtitle

This is a customizable footnote

Audio File Section

You can assign any number of audio files, but the slice have been designed for a single row of three audio files

##### Rabbi David Block

###### Writer

###### I dared to impersonate Rabbi David Block and write this fake testimonial. This is the Author Testimonials slice

##### Expansion Panel slice, with a list of Material documents

FAQ page Hero slice

This is the simplest hero which you can add to a page

FAQ Section slice

This is a second "topic" in the same slice

With its own Rich Text

This is a second FAQ Section slice - visually combined into a single section of the webpage!

This is a third topic,

defined in a separate slice

Must I add FAQ section slices one immediately after another?

Actually, no. All FAQ Section slices are combined when building the page, no matter where they were in the slices list. The combined FAQ will be placed into the resulting page at the position of the **first** FAQ Section slice encountered.

#### The Fundamentals of Parenting

# Left-aligned title for the Hero Text-Image slice

Overline Rich Text

# Hero Text with Table of Contents

Underline Rich Text

Additional plaintext with description

This is a standard Playlists carousel

# Meet our Producers

###### Producers

###### Circle

###### Members

###### Slice

###### .

###### Any

###### Number of arbitrary

###### Lines

###### Can

###### Be

###### Added

# Resources Slice - this title is a Rich Text

Team Page Founder slice

Founder Name

Founder Position

This slice is that huge section from the Team page. We use this for showcasing our founder but technically we can showcase anything here on any other page

Founder Content Title here

Team Section slice from the Team page

Human Resource #1

NDA-covered information

Human Resource #2

NDA-covered information

Human Resource #3

NDA-covered information

Text Block slice

This is the traditional Text Block slice after many improvements.

We’ve seen several formulations of a monoid: as a set, as a single-object category, as an object in a monoidal category. How much more juice can we squeeze out of this simple concept?

Let’s try. Take this definition of a monoid as a set m with a pair of functions:

μ :: m × m -> m η :: 1 -> m

Here, 1 is the terminal object in **Set** — the singleton set. The first function defines multiplication (it takes a pair of elements and returns their product), the second selects the unit element from m. Not every choice of two functions with these signatures results in a monoid. For that we need to impose additional conditions: associativity and unit laws. But let’s forget about that for a moment and just consider “potential monoids.” A pair of functions is an element of a cartesian product of two sets of functions. We know that these sets may be represented as exponential objects:

μ ∈ m m×m η ∈ m1

The cartesian product of these two sets is:

m m×m × m1

Using some high-school algebra (which works in every cartesian closed category), we can rewrite it as:

m m×m + 1

The plus sign stands for the coproduct in **Set**. We have just replaced a pair of functions with a single function — an element of the set:

m × m + 1 -> m

Any element of this set of functions is a potential monoid.

The beauty of this formulation is that it leads to interesting generalizations. For instance, how would we describe a group using this language? A group is a monoid with one additional function that assigns the inverse to every element. The latter is a function of the type m->m. As an example, integers form a group with addition as a binary operation, zero as the unit, and negation as the inverse. To define a group we would start with a triple of functions:

m × m -> m m -> m 1 -> m

As before, we can combine all these triples into one set of functions:

m × m + m + 1 -> m

We started with one binary operator (addition), one unary operator (negation), and one nullary operator (identity — here zero). We combined them into one function. All functions with this signature define potential groups.

We can go on like this. For instance, to define a ring, we would add one more binary operator and one nullary operator, and so on. Each time we end up with a function type whose left-hand side is a sum of powers (possibly including the zeroth power — the terminal object), and the right-hand side being the set itself.

Now we can go crazy with generalizations. First of all, we can replace sets with objects and functions with morphisms. We can define n-ary operators as morphisms from n-ary products. It means that we need a category that supports finite products. For nullary operators we require the existence of the terminal object. So we need a cartesian category. In order to combine these operators we need exponentials, so that’s a cartesian closed category. Finally, we need coproducts to complete our algebraic shenanigans.

Alternatively, we can just forget about the way we derived our formulas and concentrate on the final product. The sum of products on the left hand side of our morphism defines an endofunctor. What if we pick an arbitrary endofunctor F instead? In that case we don’t have to impose any constraints on our category. What we obtain is called an F-algebra.

An F-algebra is a triple consisting of an endofunctor F, an object a, and a morphism

F a -> a

The object is often called the carrier, an underlying object or, in the context of programming, the carrier *type*. The morphism is often called the evaluation function or the structure map. Think of the functor F as forming expressions and the morphism as evaluating them.

Here’s the Haskell definition of an F-algebra:

type Algebra f a = f a -> a

It identifies the algebra with its evaluation function.

In the monoid example, the functor in question is:

data MonF a = MEmpty | MAppend a a

This is Haskell for 1 + a × a (remember algebraic data structures).

A ring would be defined using the following functor:

data RingF a = RZero | ROne | RAdd a a | RMul a a | RNeg a

which is Haskell for 1 + 1 + a × a + a × a + a.

Text Block

Heavens blessed us, Milan! We can finally use pictures as a first element in Text Block and Text Block Cols slices!

Look, here! ^ Amazing! Finally!

This is called Video list but shows Playlists, take note of that!

###### The Fast of The Firstborn: If No One's Fasting, What’s The Point Of Taanit Bechorot?

Beth Lesch ●7 min video