Monad bits
Dara O Shayda
dara@compclassnotes.com
dara@compclassnotes.com
© 2012-Present CCN StudiosCreative Commons Attribution-NonCommercial-ShareAlike 4.0
ξ the head of a list
The core programmability structure of a Monad is based upon how it handles list or a finite ordered sequence of objects enclosed with brackets. The screen shot from [Borceux, Handbook of Categorical Algebra 2], where the Monad symbol ξ maintains a relation defined below which is renders an associativity identity:
The purpose of the current code we are developing is to examine the List organization in Monad, which in Borceux is discussed but nowhere else I find programmable conceptualization to count on.
So decided to code my own.
So decided to code my own.
Treating images 2D and 3D as lists then the Natural Transformation η is explored below.
🖼: Image Assembly Monad
Simple free categories of matrices to model the images both 2D and 3D.
Image concatenation or assembly paired with image segmentation and question remains: is there a Monad abstraction there, and I can say with good confidence yes.
The η
Image concatenation or assembly paired with image segmentation and question remains: is there a Monad abstraction there, and I can say with good confidence yes.
The η
img=🖼:η
Out[]=
ζζ
,
,
,ζ
,
,
,ζ
,
,
🖼:img
Out[]=
g=
img3d=🖼:ηg
Out[]=
ζζζ
,
,,ζ,
,,ζ,,,ζζ,
,,ζ
,
,
,ζ,
,,ζζ
,
,
,ζ
,
,
,ζ
,
,
🖼:img3d
Out[]=
Free ℝ-Vector space
Free ℝ-Vector space
