pandora changelog

Changelog History

Page 2

• v0.2.1 Changes

  • Generalize $ up to a method of Divariant typeclass
  • Put concrete data structures to Specific submodule
  • 🚚 Move Nonempty type family to separated module
  • Define Cartesian type class
  • 📇 Rename ? to % to use ? as boolean multi-if
  • Replace ifelse method from Setoid module
  • Convert :> to a newtype
  • 📇 Rename Composition class to Interpreted
  • 🚚 Rename Junction machinery to Joint and move it to Controlflow module
  • 📇 Rename > type operator to :=
  • Create :# type synonymous for Tagged datatype
  • ✂ Remove untag in favor of extract method
  • 📇 Rename Tagged constructor of Tagged to Tag

• v0.2.0 Changes

  • Define Representable functor typeclass
  • Define Pointable, Applicative, Bindable and Representable instances for ->
  • Define infix Adjoint operators - -| and |-
  • Define Adjoint instance for Stateful and Storage datatypes
  • 🔄 Change Graph definition: from type synonymous to newtype
  • 📇 Rename >< to >, :.: to .:, .:. to :.
  • ✂ Remove all instances for Junction schemes
  • Define type operators for profunctorish types: ::|:., ::|.: and ::|::
  • Define Divariant (also known as Profunctor) Functor typeclass

• v0.1.9 Changes

  • 🔄 Change Stack definition: from type synonymous to newtype, change operations accordingly
  • Define .:. composition: the same thing but with reverse order
  • 🔄 Change Nonempty type family, family instances should be defined for each data structure
  • Define :> type operator for transformers
  • Define Distributive instance for -> datatype
  • 📇 Rename idle method of Avoidable typeclass to empty
  • ✂ Remove a parameter from Layout to be able to use natural transformations in methods
  • Return filter method to Stack data structure
  • 📇 Rename unwrap to untwist method in Twister module
  • 📇 Rename composition to unwrap and Outline to Primary in Composition type class
  • 📇 Rename equip to wrap and Layout to Schema in Transformer typeclass
  • 👉 Make Composition a superclass for Transformer typeclass
  • 🚚 Move all Junction modules to Pattern submodule except Kan

• v0.1.8 Changes

  • 🚚 Rename T junction scheme to UT and move it to Schemes submodule and remove up method
  • 🚚 Rename Y junction scheme to UTU and move it to Schemes submodule and remove :>: type operator
  • ➕ Add variance type arguments to UT, UTU and TUT schemes
  • 📇 Rename U to TU, UU to TUV, UUU to TUVW and put them into Schemes module
  • Define Composition typeclass and define its instances for TU, TUV, TUVW, UT and UTU
  • Define Transformer typeclass and define its instance for Stateful datatype
  • Replace transform on lay and add equip method in Transformer typeclass
  • Define Covariant, Applicative, Pointable, Bindable and Monad instances for Stateful transformer
  • ✂ Remove :!: type operator
  • Define Composition and Transformer instances for Maybe and Conclusion
  • Define Core, Paradigm and Pattern umbrella modules

• v0.1.7 Changes

  • Define ifelse function for Boolean values
  • 🔄 Change Stack and Nonempty definitions, temporarily remove filter
  • Define <**>, <***>, <****> methods for Applicative to compact expressions
  • 🔄 Change Graph definition
  • 📇 Rename ask to env method of Environmental datatype
  • Introduce >< type operator to separate functors from its arguments
  • Define Determinable typeclass and define its instance for Predicate
  • Define curry and uncurry for Product datatype
  • Flip arguments of statefully method of Stateful datatype
  • Exclude inner effects from Environmental, Storage and Stateful datatypes

• v0.1.6 Changes

  • Define ->>>, ->>>>, ->>>>> methods for Traversable to compact expressions
  • 🚚 Move Natural transformation from Functor to Transformation module
  • Define infix and infix flipped versions of methods of Functor typeclasses
  • Define >>>-, >>>>-, >>>>>- methods for Distributive to compact expressions
  • 📇 Rename <> method of Semigroup typeclass to +
  • 📇 Rename >< method of Ringoid typeclass to *
  • 📇 Rename unit to zero method of Monoid typeclass
  • Define Quasiring typeclass

• v0.1.5 Changes

  • ➕ Add <&> and >&< methods for Covariant and Contravariant functors accordingly
  • Define Traversable instance for Product datatype
  • 📇 Rename Cofree to Twister datatype (we will use the first name later)
  • Define fixity for Jet's and Twister's constructors
  • 📇 Rename Exclusive to Avoidable typeclass and exclusive to idle method
  • Define Tagged datatype for attaching type information to the value
  • Define Proxy datatype for holding no data, but having a phantom parameter
  • Define Validation datatype (similar to Conclusion, but can collect errors)

• v0.1.4 Changes

  • Define Jet datatype in Basis module
  • ➕ Add fail method for Conclusion datatype
  • Define find method in terms of stateful traversing
  • Define filter method for Stack datastructure
  • Define loeb method for Covariant type class
  • Define Variation datatype in Basis module
  • Define infix versions of comap with various nesting levels
  • Define infix versions of contramap with various nesting levels
  • Rename Product constructor from :* to :*:
  • Define Has and Injective type families for Product proofs

• v0.1.3 Changes

  • Define Object instances for Cofree datatype
  • Define all Object pattern instances for Constant datatype
  • Define reset and shift methods for Continuation datatype
  • Define Endo datatype in Basis module
  • Define Object instances for transformer schemes
  • Define Binary tree concrete structure
  • Define some Object instances for Jack datatype
  • ✂ Remove Hollow ad-hoc typeclass
  • 🔀 Merge Property and Concrete modules back

• v0.1.2 Changes

  • Define Pipeline control flow paradigm
  • Split Structure modules on Property and Concrete
  • Define Hollow type class for handling empty structures
  • Extract Nonempty into a separated module
  • Define Graph concrete structure
  • Define infix :-. type operator for Lens
  • Define Object instances for Product datatype

• « First
• ‹ Prev
• 1
• 2
• 3
• Next ›
• Last »