numhask-free 0.0.2 → 0.0.3

raw patch · 2 files changed

+7/−8 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• numhask-free.cabal +3/−3
• src/NumHask/FreeAlgebra.hs +4/−5

@@ -1,8 +1,8 @@ cabal-version: 2.4 name:          numhask-free-version:       0.0.2-synopsis: Numerical free algebras-description: __The Free Num is a Bag of Sequences.__+version:       0.0.3+synopsis: numerical free algebras+description: __The Free Num is a Sequence of Bags.__              .              "NumHask.FreeAlgebra" explains.              .

@@ -14,7 +14,7 @@ {-# OPTIONS_GHC -Wall #-} {-# OPTIONS_GHC -fno-warn-name-shadowing #-} --- | __A 'Control.Monad.Free.Free' 'Num' is a 'Bag' of 'Seq'uences.__+-- | __A 'Control.Monad.Free.Free' 'Num' is a 'Seq'uence of 'Bag's.__ -- -- One of the many things that sparks joy in Haskell is the density of expression that can be achieved. If it wasn't for a few quirks of the language, and if 'Ring' is substituted for 'Num', a free ring could be concretely defined as 'Control.Monad.Free.Free' ('Data.Functor.Compose.Compose' 'Bag' 'Seq') a. --@@ -60,9 +60,9 @@ -- -- The end result is that any notion of a free object applied to a 'Num' is difficult to imagine. If the interface is cleaned up, however, as in 'Ring' from the [numhask](https://hackage.haskell.org/package/numhask) library, with attention paid to each and every law, then resolution improves, and we are able to sharpen our tools. ----- A better definition of what a number is can lead to cleaner, faster coding patterns and design, and this, in turn, might eventually lead to ubiquitous usage of Haskell in numerical computing. As it stands right now, Haskell usage is restricted to only the most stubborn and dreamy of the numeric-analyst crew to which I claim membership of.+-- A better definition of what our number systems are can lead to cleaner, faster coding patterns and design. In turn, this might eventually lead to ubiquitous usage of Haskell in numerical computing. As it stands right now, Haskell usage is restricted to only the most stubborn and dreamy of the numeric-analyst crew to which I claim membership of. ----- This article-module then is, in part, a plea to release the Haskell numerical classes from their existing constraints so we can begin to imagine some sort of future of numerical computation within the halls proper of Haskell. With apologies to Marie Kondo (and unsupported strikeout):+-- This article-module is, in part, a plea to release the Haskell numerical classes from their existing dusty drawers so we can begin to imagine some sort of future of numerical computation within the halls proper of Haskell. With apologies to Marie Kondo (and unsupported strikeout): -- -- The __prelude__ (space) within which we __code__ (live) should be for the __language__ (person) we are becoming now, not for the __language__ (person) we were in the past. --@@ -70,7 +70,6 @@ -- -- Imagine what it would be like to have a __prelude__ (bookshelf) filled only with __functions__ (books) that you really love. Isn’t that image spellbinding? For someone who loves __functions__ (books), what greater happiness could there be? ----- -- == What is an algebra? -- -- /Art is fire plus algebra./ ~ Jorge Luis Borges@@ -794,7 +793,7 @@ -- -- > newtype Fix f = Fix (f (Fix f)) ----- If Bag could form a Functor instance, then the Free Ring could be expressed as @'Control.Monad.Free.Free' ('Compose' 'Bag' 'Seq') a@+-- If Bag could form a Functor instance, then the Free Ring could be expressed as @'Control.Monad.Free.Free' ('Data.Functor.Compose.Compose' 'Bag' 'Seq') a@ -- -- which is a very clean result. data FreeRing laws a