Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

+newline in order to render ___ #600

Merged
merged 1 commit into from
May 16, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions docsrc/content/abstraction-alternative.fsx
Original file line number Diff line number Diff line change
Expand Up @@ -6,8 +6,10 @@
(**
Alternative
===========

Applicative Functors which also have a monoid structure.
___

Minimal complete definition
---------------------------
* ``return x``   /   ``result x``
Expand Down
2 changes: 2 additions & 0 deletions docsrc/content/abstraction-applicative.fsx
Original file line number Diff line number Diff line change
Expand Up @@ -6,8 +6,10 @@
(**
Applicative
===========

A functor with application, providing operations to embed pure expressions (``return``), and sequence computations and combine their results (``<*>``).
___

Minimal complete definition
---------------------------
* ``return x`` &nbsp; / &nbsp; ``result x``
Expand Down
2 changes: 2 additions & 0 deletions docsrc/content/abstraction-functor.fsx
Original file line number Diff line number Diff line change
Expand Up @@ -6,8 +6,10 @@
(**
Functor
=======

The Functor abstraction is used for types that can be mapped over.
___

Minimal complete definition
---------------------------
* ``map f x`` &nbsp; / &nbsp; ``(|>>) x f`` &nbsp; / &nbsp; ``(<<|) f x`` &nbsp; / &nbsp; ``(<!>) f x``
Expand Down
2 changes: 2 additions & 0 deletions docsrc/content/abstraction-monoid.fsx
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,9 @@
Monoid
======
Types with an associative binary operation that has an identity.

___

Minimal complete definition
---------------------------
* `zero``
Expand Down
2 changes: 2 additions & 0 deletions docsrc/content/abstraction-semigroup.fsx
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,10 @@
(**
Semigroup
=========

In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.
___

Minimal complete definition
---------------------------
* ``(+)`` &nbsp; / &nbsp; ``(++)``
Expand Down
2 changes: 2 additions & 0 deletions docsrc/content/abstraction-zipapplicative.fsx
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,9 @@
Zip Applicative (aka Non-sequential Applicative)
================================================
A functor with application, providing operations to embed pure expressions (``pur``), run computations pointwise and/or paralell and combine their results (``<.>``).

___

Minimal complete definition
---------------------------
* ``pur x`` &nbsp;
Expand Down
Loading