Changelog for pandora-0.5.0
0.1.1
- Define
attached
destructor forProduct
datatype - Define
empty
destructor forStack
structure - Replace
flip
on?
type operator - Remove type parameter from
Stack
type synonymous - Split
structure
andvalue
inNonempty
type family - Define
Invariant
instance forConstant
datatype - Remove all
Invariant
methods exceptinvmap
- Extract
Junction
module fromBasis
0.1.2
- Define
Pipeline
control flow paradigm - Split
Structure
modules onProperty
andConcrete
- Define
Hollow
type class for handling empty structures - Extract
Nonempty
into a separated module - Define
Graph
concrete structure - Define infix
:-.
type operator forLens
- Define
Object
instances forProduct
datatype
0.1.3
- Define
Object
instances forCofree
datatype - Define all
Object
pattern instances forConstant
datatype - Define
reset
andshift
methods forContinuation
datatype - Define
Endo
datatype inBasis
module - Define
Object
instances for transformer schemes - Define
Binary
tree concrete structure - Define some
Object
instances forJack
datatype - Remove
Hollow
ad-hoc typeclass - Merge
Property
andConcrete
modules back
0.1.4
- Define
Jet
datatype inBasis
module - Add
fail
method forConclusion
datatype - Define
find
method in terms of stateful traversing - Define
filter
method forStack
datastructure - Define
loeb
method forCovariant
type class - Define
Variation
datatype inBasis
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
andInjective
type families forProduct
proofs
0.1.5
- Add
<&>
and>&<
methods forCovariant
andContravariant
functors accordingly - Define
Traversable
instance forProduct
datatype - Rename
Cofree
toTwister
datatype (we will use the first name later) - Define fixity for
Jet
's andTwister
's constructors - Rename
Exclusive
toAvoidable
typeclass andexclusive
toidle
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 toConclusion
, but can collect errors)
0.1.6
- Define
->>>
,->>>>
,->>>>>
methods forTraversable
to compact expressions - Move
Natural
transformation fromFunctor
toTransformation
module - Define infix and infix flipped versions of methods of
Functor
typeclasses - Define
>>>-
,>>>>-
,>>>>>-
methods forDistributive
to compact expressions - Rename
<>
method ofSemigroup
typeclass to+
- Rename
><
method ofRingoid
typeclass to*
- Rename
unit
tozero
method ofMonoid
typeclass - Define
Quasiring
typeclass
0.1.7
- Define
ifelse
function forBoolean
values - Change
Stack
andNonempty
definitions, temporarily removefilter
- Define
<**>
,<***>
,<****>
methods forApplicative
to compact expressions - Change
Graph
definition - Rename
ask
toenv
method ofEnvironmental
datatype - Introduce
><
type operator to separate functors from its arguments - Define
Determinable
typeclass and define its instance forPredicate
- Flip arguments of
statefully
method ofStateful
datatype - Exclude inner effects from
Environmental
,Storage
andStateful
datatypes
0.1.8
- Rename
T
junction scheme toUT
and move it toSchemes
submodule and removeup
method - Rename
Y
junction scheme toUTU
and move it toSchemes
submodule and remove:>:
type operator - Add variance type arguments to
UT
,UTU
andTUT
schemes - Rename
U
toTU
,UU
toTUV
,UUU
toTUVW
and put them intoSchemes
module - Define
Composition
typeclass and define its instances forTU
,TUV
,TUVW
,UT
andUTU
- Define
Transformer
typeclass and define its instance forStateful
datatype - Replace
transform
onlay
and addequip
method inTransformer
typeclass - Define
Covariant
,Applicative
,Pointable
,Bindable
andMonad
instances forStateful
transformer - Remove
:!:
type operator - Define
Composition
andTransformer
instances forMaybe
andConclusion
- Define
Core
,Paradigm
andPattern
umbrella modules
0.1.9
- 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 ofAvoidable
typeclass toempty
- Remove
a
parameter fromLayout
to be able to use natural transformations in methods - Return
filter
method toStack
data structure - Rename
unwrap
tountwist
method inTwister
module - Rename
composition
tounwrap
andOutline
toPrimary
inComposition
type class - Rename
equip
towrap
andLayout
toSchema
inTransformer
typeclass - Make
Composition
a superclass forTransformer
typeclass - Move all
Junction
modules toPattern
submodule exceptKan
0.2.0
- Define
Representable
functor typeclass - Define
Pointable
,Applicative
,Bindable
andRepresentable
instances for->
- Define infix
Adjoint
operators --|
and|-
- Define
Adjoint
instance forStateful
andStorage
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 asProfunctor
)Functor
typeclass
0.2.1
- Generalize
$
up to a method ofDivariant
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 fromSetoid
module - Convert
:>
to a newtype - Rename
Composition
class toInterpreted
- Rename
Junction
machinery toJoint
and move it toControlflow
module - Rename
>
type operator to:=
- Create
:#
type synonymous forTagged
datatype - Remove
untag
in favor ofextract
method - Rename
Tagged
constructor ofTagged
toTag
0.2.2
- Change types of
lay
andwrap
methods ofTransformer
class - Define
Adaptable
type class for fitting effects in schemas - Define
Failable
andfailure
for adaptableConclusion
- Define
Optional
andnothing
for adaptableMaybe
- Rename
Stateful
toState
,get
tocurrent
,put
toreplace
- Define
Stateful
adaptable constraint and adaptget
,modify
andput
- Rename
Environmental
toEnvironment
- Make
env
adaptable effect and removelocal
- Define
Accumulator
effect and it's adaptablegather
method - Define
|->
(Coalgebra) and<-|
(Algebra) type synonyms - Remove
oblige
in favor ofLiftable
instance ofContinuation
- Remove
environmentally
in favor ofInterpreted
instance forEnvironment
- Remove
statefully
in favor ofInterpreted
instance forState
0.2.3
- Define
Category
type class withidentity
and.
methods - Change
>->
signature:a -> b
tov a d
andc -> d
tov c d
- Extract
Schema
fromTransformer
type class asSchematic
type family - Rename
Transformer
type class toMonadic
- Define
Comonadic
type class for comonad transformers - Define
Transformer
umbrella module and type family - Rename
:<
data constructor toTwister
to not confuse it with comonad transformer type operator - Use
UT
joint scheme forStack
andGraph
data structures - Remove
Variant
type in favor ofCovariant
andContravariant
constraints in joint schemes - Add
Covariant
constraint on schema parameter inAdaptable
type class - Rename
Storage
type toStore
- Define
Interpreted
,Schematic
andComonadic
instances forStore
type
0.2.4
- Remove
Pandora.Core.Transformation
module and move~>
toFunctor
module - Define
Adaptable
instances for comonad transformer schemes - Make
position
andaccess
methods ofStore
adaptable - Rename
unwrap
method ofInterpreted
type class torun
- Define
Bivariant
functor type class - Define
zoom
optical operator - apply lens within some part ofState
- Make
top
method ofStack
data structure a lens - Make
zoom
method ofOptics
adaptable for bigger state - Define
Traced
for adaptableEnvironment
comonad - Define
cata
,ana
andhylo
methods ofFix
- Define
Equipment
datatype to useComonad
Product
transformer - Define adaptable
retrieve
method ofEquipment
- Extract
Imprint
fromEnvironment
module
0.2.5
- Define
Semiring
typeclass - Define
Stream
module and type - Move
Liftable
andLowerable
modules fromFunctor
toTransformer
submodule - Define
Hoistable
module and typeclass - Rename
TUV
joint schema toTUT
- Modify
UTU
joint schema internals - Remove
&&
and||
Boolean
operators (use*
and+
instead) - Define precedence for
*
and+
- Change superclass of
Group
class -Quasiring
instead ofMonoid
- Rename
Jet
's constructor toJet
(previously -:-
) - Rename
Group
's method frominverse
toinvert
- Remove
not
method ofBoolean
, (useinvert
instead) - Remove
Injective
andHas
type families - Change superclasses for
Liftable
andLowerable
classes to provide a law
0.2.6
- Change order of arguments for
TUT
joint schema Binary
trees can be empty- Define
left_sub_tree
andright_sub_tree
lenses ofBinary
tree - Fix
insert
function:Binary
tree should not contain duplicate values - Remove
Cartesian
type class - Move
Nonempty
module toVariation
submodule - Remove
Specific
module - Add functional dependency to
Nonempty
type family and distribute instances - Define
left
andright
natural transformations fromWye
toMaybe
- Define experimental
Substructure
type class - Remove
left_sub_tree
andright_sub_tree
lenses ofBinary
tree - Define
this
andthat
methods fromVariation
toMaybe
- Define
Backwards
type to runApplicative
actions in reverse order
0.2.7
- Replace
Lan
andRan
withKan
data family - Rename
Free
toInstruction
and its constructors:Pure
toEnter
andImpure
toInstruct
- Define
Ring
typeclass withGroup
superclass - Define
Weighted
type family and define instance forGraph
- Add
Leap
toEdges
to indicate a connection with only the first vertex - Remove
Graph
structure andWeighted
type family - Define
Reverse
type to runTraversable
in reverse order withBackwards
- Rename
Twister
toConstruction
(in contrast ofInstruction
) - Split
Basis
onFunctor
andTransformer
modules inPrimary
- Rename
untwist
todeconstruct
inConstruction
- Define
Rose
tree structure - Replace
UT
joint scheme withTU
in data structures - Change
sub
method ofSubstructure
- it always returnsTagged
value - Rename
Construction
constructor ofConstruction
toConstruct
0.2.8
- Define
Outline
free applicative transformer - Define
Delta
datatype - Define
Wedge
datatype - Rename
Variation
toThese
- Define experimental methods in
Bindable
class -$>>=
and>>=$
- Define
here
andthere
methods fromWedge
toMaybe
- Move
Boolean
definition to its own module - Move
Ordering
definition to its own module - Rename
Variation
submodule toAbility
and create umbrella-module - Define
Focusable
typeclass for getting root and creating singleton - Replace
top
method ofStack
structure withFocusable
instance - Add
Covariant
constraint onnatural transformation
inHoistable
typeclass
0.2.9
- Define
Zipper
type family to walk datastructures with context - Define
Tap
datatype for context dependent values - Define type synonyms for
TU
,UT
,TUT
andUTU
joint schemes - Move
Schemes
module toParadigm
submodule - Move
$
definition fromDivariant
toCategory
- Define generalized point free combinators in
Covariant
module - Rename
Joint
module ToEffect
- Define left and right
zig
,zig-zig
andzig-zag
Splay
rotations forBinary
tree - Define experimental methods in
Extendable
class -$=>>
and<<=$
- Define
Rotatable
typeclass to rotate trees - Rename
sub
method ofSubstructure
typeclass tosubstructure
- Define
sub
method which doesn't involveTagged
- Change
Focusable
typeclass - now it's possible to point not only top/root
0.3.0
- Rename
Root
datatype toLocation
withHead
(stack) andRoot
(tree) constructors - Define
represent
as lens inRepresentable
containers - Define
Equivalence
datatype and defineContravariant
instance for it - Define
swop
forWye
(useful if you want to invert binary tree withhoist swap
) - Add experimental
Monotonic
typeclass - Implement delete method for Stack
- Define
Comprehension
wrapper for data structures that can behave like list comprehensions - Define experimental
Insertable
typeclass - Define
Day convolution
datatype inTransformer
module - Define experimental methods:
<*+>
,<**+>
,<***+>
- Rename Bindable method
>>=$
to<>>=
- Move
Comprehension
wrapper fromConstruction
toStructure.Ability
module
0.3.1
- Define
Set
interface for data structures withmember
method - Move
zoom
function toInventory
module - Move
Adjoint
instance for(:*:)
and(->)
toParadigm.Primary.Functor
module - Remove
Schematic
module and moveSchematic
type family toInterpreted
module - Change arity of
Schematic
type family - Remove
lay
method ofMonadic
type class, uselift
instead - Remove
flick
method ofComonadic
type class, uselower
instead - Change
lift
constraint: fromCovariant
toTraversable
0.3.2
- Define experimental methods:
->>=
,>>=-
,-=<<
,=<<-
- Define
interruptable
method forContinuation
- Define
Catchable
typeclass to catch errors fromConclusion
- Define
repeat
method ofStream
datatype - Define
subset
method ofSet
interface - Define
satisfy
method inPredicate
module - Make
fold
andfind
stateful expressions - Define
equate
method ofPredicate
dataype - Define
Zipper
instance ofNonempty Stack
- Define
forward'
andbackward'
methods forZipper
ofNonempty Stack
- Rename
iterate
method ofMonotonic
typeclass tobypass
- Rename
coiterate
method ofConstruction
datatype toiterate
0.3.3
- Define inductive
Natural
number datatype inObject
module - Add
cardinality
method toSet
interface - Define new functor schemes:
T_
,T_U
,U_T
- Define
Zipper
instance forNonempty Binary
- Replace
forward
,forward'
,backward
,backward'
methods withRotatable
instances - Add
>-<
operator toInvariant
typeclass - Add
:~.
type synonymous for polymorphic lens - Replace
maybe
with more genericbypass
- Rename
bypass
method ofMonotonic
toreduce
- Add
resolve
method ofMonotonic
typeclass - Rename
iterate
method ofConstruction
to.-+
- Define
via
method to use transformer as wrappers
0.3.4
- Define
branches
to createWye a
from twoMaybe a
- Rename
<:.:>
,>:.:>
,<:.:<
,>:.:<
to<:*:>
,>:*:>
,<:*:<
,>:*:<
- Add
unite
method toInterpreted
typeclass - Rename
Direction
toVertical
- Define
Nullable
typeclass for structures which can be null - Define
>>=:>
and<:=<<
methods to use>>=
withadapt
- Define
not
method forPredicate
inversion - Make
Monoid
a superclass forGroup
- Define
-
method inGroup
typeclass - Rename
via
to-=:
in Interpreted module - Flip arguments for
Bindable
$>>=
andExtendable
$=>>
methods - Define experimental methods:
-|$
,$|-
0.3.5
- Define inductive
Denumerator
number datatype inObject
module - Rename
Natural
datatype toNumerator
- Define
Measurable
typeclass to measure datastructures - Define
Convertible
typeclass for structure transformation - Define
binary
method to constructBinary
trees from other structures - Remove
pop
method ofStack
, useSubstructure
Tail
instance instead - Appear additional type parameter in
Substructure
typeclass - Define
Divisible
typeclass - Define
Function
module to contain instances for function - Move
!
,%
,&
toFunction
module - Remove
Pandora.Core.Morphism
module - Define
$$|-
,$$$|-
,$$$$|-
methods ofAdjoint
typeclass - Define
match
method to chain predicates
0.3.6
- Define
Walk
datatype to define different tree/graph traversals - Make
a
paremeter in:~.
to be existentially qualified - Rename type operators:
|->
to:=>
and<-|
to<:=
- Define experimental
||=
method to apply a function inside transformer - Define
subview
,subplace
andsubstitute
methods inSubstructure
typeclass - Put
sub
method intoSubstructure
typeclass - Remove
^.
,.~
and%~
infix optics methods - Generalize
T_U
andU_T
schemes over somep
(Bifunctor
/Profunctor
) - Define experimental
Deletable
typeclass - Define experimental
adjust
,magnify
,=<>
,~<>
- Define experimental
Accessible
type class - Rename
access
method tolook
inOptics
module - Rename
Convertible
type class toMorphable
- Remove
Rotatable
type class in favor ofMorphable
- Define
<:.:>
,>:.:>
,<:.:<
,>:.:<
type synonyms - Delete
Delta
datatype in favor of(:*:) <:.:> t
0.3.7
- Rename
insert
method to+=
inInsertable
typeclass - Rename
delete
method to-=
inDeletable
typeclass - Create
Some
umbrella module for certain data structures - Define experimental
~~>
type synonyms - Rename
/=
method ofSetoid
typeclass to!=
- Define
rotate
andinto
method ofMorphable
typeclass - Remove
T_
joint scheme in favor ofT_U
- Define
Prefixed
wrapper for data structures whose values can be prefixed - Move
Comprehension
andPrefixed
modules fromAbility
toModification
- Define experimental
Dictionary
typeclass - Add
=||
method toInterpreted
typeclass - Remove
hush
,left
,right
,this
,there
,here
,note
methods in favor ofMorphable
instance - Define
Flip
transformer for flipping type arguments - Replace two parementers in
>->
method ofDivariant
with usual functions
0.3.8
- Define
twosome
method to lift two parts to<:.:> (:*:)
scheme - Remove
branches
method in favor ofMorphable
instance - Change order of type arguments in
T_U
scheme - Define
!!
and!!!
infix operators - Define
premorph
to replaceextract . run
expressions forMorphable
instances - Define experimental
/
for providing arguments to function modify
andreplaces
methods ofState
effect returns result of an applied function- Change precedence of
->>
method ofTraversable
- from 3 to 5 - Rename
Stack
datastructure toList
- Define new type synonymous:
:=:=>
- Define experimental
Insert
,Push
,Pop
verbs forMorphable
ability - Remove
Insertable
ability for datastructures - Change order of arguments in
<:.:>
,>:.:>
,<:.:<
,>:.:<
type synonyms - Define fixity and precedence for
TU
,UT
,TUT
andT_U
type synonyms - Define
Stack
typeclass with no methods but withPush
andPop
constraints
0.3.9
- Remove
Deletable
ability for datastructures in favor ofMorphable Delete First
instance - Generalize
filter
and move it fromList
toMorphable
module - Define
Set
interface as constraint - Generalize
Equivalence
and rename it toConvergence
- Define
Equivalence
andComparison
as type synonyms forConvergence
- Define version of
<*>
with flipped arguments -<%>
- Generalize
||=
and=||
methods ofInterpreted
on anotherInterpeted
functor - Define
pass
method inPointable
typeclass - Define experimental
reconcile
method inState
module - Remove
Maybe
fromPrefixed
type synonymous - Define
discover
forMorphable Find
instances with composite keys - Change
subset
method ofSet
interface: returnsConvergence Boolean
- Remove
Dictonary
typeclass - Define
Lookup
verb for finding elements in datastructures by key - Define
Cycle
typeclass withChain
superclass - Move
lookup
anddiscover
exressions toDictionary
module
0.4.0
- Define size typed
Vector
data structure - Move
Vertical
datatype fromBinary
toMorphable
module - Remove
substitute
,subplace
,subview
methods fromSubstructure
typeclass - Remove
>>=:>
and<:=<<
infix operators - Move
Vector
datatype toLinear
umbrella-module - Rename
/
infix function application operator to#
- Define
$:
and$::
infix function application operators - Decrease precedence for
:*:
infix operator - Change arguments order in
order
expression - Rename
$:
to#
,$::
to#:
,$:::
to#::
and define#:::
- Remove
#:
,#::
,#:::
infix operators - Change precedence for
.
infix operator - Change precedence for
*
,+
,-
infix operators - Change precedence for
#
infix operator - Move
Linear
module toParadigm.Primary
- Define experimental
Vectorize
typeclass - Define
Matrix
datatype as combination ofVector
's - Define
|>
datatype to use it for combiningSubstructure
instances - Define
Substructured
type synonymous as constraint kind
0.4.1
- Generalize
$
and#
Category
's infix operators - Add
Covariant
constraint inBivariant
andDivariant
typeclasses definition - Add infix version of
hoist
method inHoistable
typeclass -/|\
- Define
PQ_
joint schema exclusively forLens
type - Change
Lens
representation - wrap it inPQ_
joint schema - Remove
|>
lens composition operator in favor of.
Category
method - Rename
.|..
,.|...
,.|....
to.#..
,.#...
,.#....
and move them toCovariant
typeclass - Change precedence for
||=
and=||
infix operators - Define precedence for
>-<
infix operator - Move
|>
existential polymorphic type toCore.Functor
module - Remove
|>
existential polymorphic type and its Substructure instance - Remove
lookup
anddiscover
methods fromDictionary
interface - Define
lookup
method inMorphable
ability module - Remove
binary
expression fromBinary
module - Define
Morphed
type synonymous as constraint kind - Define
Combinative
type family - Remove
Location
datatype inFocusable
module - Remove
Focusable
ability if favor ofStructure
typeclass - Define
<$$
,<$$$
,<$$$$
,$$>
,$$$>
,$$$$>
infix operators inCovariant
typeclass - Define
<$||=
,<$$||=
,<$$$||=
,<$$$$||=
infix operators inInterpreted
typeclass - Define
=||$>
,=||$$>
,=||$$$>
,=||$$$$>
infix operators inInterpreted
typeclass
0.4.2
- Rename
>-<
method ofInvariant
typeclass to<$<
- Define
P_T
joint schema exclusively forPrism
type - Define
Prism
type and itspreview
method - Redefine
Lens
type asOptics
onIdentity
- Define
#=@
type operator as synonymous forOptics
- Redefine
Substructure
typeclass with polymorphicOptics
- Generalize optical
view
,set
,over
methods - Change
Substructured
constraint type according to newSubstructure
definition - Define
:::
- type operator for almost anything higher kinded - Redefine
Zipper
- add possible moves to type definition - Define experimental
Fastenable
type family to have it asConstraint
- Remove
:~.
type operator inOptics
module - Rename
Optics
type synonymous toLens
- Define
PTU
joint schema - Define
P_Q_T
joint schema - Redefine
Lens
type synonymous and useP_Q_T
joint schema - Define
Convex
andObscure
type families forLens
- Change
Substructured
constraint - add paramater forAvailable
- Define experimental
Impliable
typeclass - Remove
:-.
type operator inOptics
module
0.4.3
- Rename
!
to!.
inFunction
module - Rename
!!
to!..
inFunction
module - Rename
!!!
to!...
inFunction
module - Define experimental
Covariant_
typeclass - Define experimental
-<$$>-
method ofCovariant_
typeclass - Define experimental
-.#..-
method inFunction
module - Define experimental
Contravariant_
typeclass - Define experimental
Pointable_
typeclass - Define experimental
Bindable_
typeclass - Define experimental
Bivariant_
typeclass - Define experimental
Divariant_
typeclass - Define experimental
Extendable_
typeclass - Use experimental
Covariant_
as superclass ofExtractable
- Define
Covariant_
superclasses forBivariant_
- Define
Covariant_
andContravariant_
superclasses forDivariant_
- Define experimental
-<<$$>-
and-<$$>>-
methods ofCovariant_
typeclass - Use experimental
Covariant_
as superclass ofPointable
- Define experimental
Adjoint_
typeclass - Define experimental
Applicative_
typeclass - Define experimental
Divisible_
typeclass - Define experimental
-<*>-
method - Use experimental
Covariant_
as superclass ofLowerable
- Remove
Covariant
superclass ofLiftable
- Remove
Covariant
superclass ofHoistable
0.4.4
- Remove experimental
Pointable_
typeclass - Use experimental
Covariant_
as superclass ofDistributive
- Use experimental
Covariant_
as superclass ofTraversable
- Define experimental
Traversable_
typeclass - Define experimental
Distributibe_
typeclass - Define experimental
-<<-<<-
method ofTraversable_
typeclass - Remove
Adjoint
typeclass - Rename experimental
Adjoint_
toAdjoint
- Remove
Bivariant
typeclass - Rename experimental
Bivariant_
toBivariant
- Remove
Distributive
typeclass - Rename experimental
Distributive_
toDistributive
- Remove
Divariant
typeclass - Rename experimental
Divariant_
toDivariant
- Rename
Product
type to:*:
- Move
Paradigm.Primary.Functor.Function
module toParadigm.Primary.Algebraic.Exponential
- Move
Paradigm.Primary.Functor.Product
module toParadigm.Primary.Algebraic.Product
- Add
Covariant_
,Pointable
andApplicative_
constraints toTraversable_
typeclass - Remove
join_
method fromBindable_
typeclass - Remove
Traversable
typeclass - Rename experimental
Traversable_
toTraversable
- Remove
Bindable
typeclass - Rename experimental
Bindable_
toBindable
- Use experimental
Extendable_
as superclass forComonad
- Remove
Extendable
typeclass - Rename experimental
Extendable_
toExtendable
- Rename experimental
Applicative_
toSemimonoidal
0.4.5
- Define
Endofunctor
type family - Define
Sum
module inAlgebraic
with:+:
type - Define experimental
Day_
transformer - Define experimental
Semimonoidal_
typeclass - Define
Semigroupoid
typeclass as generalization ofCategory
- Define
Applicative_
andAlternative_
type class aliases ofSemimonoidal_
- Define experimental
-*-
method ofSemonoidal_
typeclass - Define experimental
-+-
method ofSemonoidal_
typeclass - Use experimental
Semimonoidal_
as superclass ofTraversable
- Remove
-<*>-
method ofSemimonoidal
typeclass - Remove
Semimonoidal
typeclass - Rename
Semimonoidal_
typeclass toSemimonoidal
- Rename
-*-
method ofSemimonoidal
to-<*>-
- Use
Semigroupoid
as superclass forSemimonoidal
- Define
*>-
andforever_
methods ofApplicative_
typeclass - Remove
<+*>
,<**+>
,<***+>
methods - Remove
Applicative
typeclass - Remove
satisfy
method ofPredicate
- Remove
Alternative
typeclass - Remove
Avoidable
typeclass - Change
-<$$$>-
: works with endofunctors - Define
-<$$$$>-
operator ofCovariant_
typeclass - Use experimental
Covariant_
inInterpreted
- Define
$>-
,$$>-
,$$$>-
methods ofCovariant_
typeclass - Remove
Covariant
typeclass - Rename experimental
Covariant_
toCovariant
- Remove
Determinable
typeclass - Remove
Divisible_
typeclass - Remove
Contravariant
typeclass - Rename experimental
Contravariant_
toContravariant
0.4.6
- Define
void
method inAlgebraic
module - Define
<--
type synonymous for reverted arrows - Define
Zero
module inAlgebraic
directory - Define
One
module inAlgebraic
directory - Rename
One
constructor inDenumerator
toSingle
- Define
Unit
type family - Define
Monoidal
typeclass - Define
absurd
method - Define
empty
method - Define
sum
method - Add
Monoidal
constraint toApplicative
andAlternative
constraints - Define
point_
method - Use
Monoidal
superclass inTraversable
instead ofPointable
- Use
Monoidal
superclass inMonad
instead ofPointable
- Remove
Pointable
typeclass - Rename
point_
topoint
- Define
extract_
method - Remove
Extractable
typeclass - Rename
extract_
toextract
- Use
Monoidal
as superclass ofComonad
- Rename
multiply_
tomultiply
- Rearrange type parameters in
Covariant
typeclass - Rearrange type parameters in
Contravariant
typeclass - Rearrange type parameters in
Semimonoidal
typeclass - Rearrange type parameters in
Adjoint
typeclass - Rearrange type parameters in
Bivariant
typeclass - Rearrange type parameters in
Traversable
typeclass - Rearrange type parameters in
Distributive
typeclass - Rearrange type parameters in
Bindaple
typeclass - Rearrange type parameters in
Extendable
typeclass - Rearrange type parameters in
Monoidal
typeclass - Rearrange type parameters in
Divariant
typeclass - Generalize
Liftable
typeclass - Generalize
Lowerable
typeclass
0.4.7
- Remove
hoist
method fromHoistable
typeclass - Rename
-<$>-
method to<$>
inCovariant
typeclasss - Rename
->$<-
method to>$<
inContravariant
typeclass - Define
Straight
transformer - Define
-->
type synonymous - Define
Opposite
type family - Define experimental
Appliable
typeclass - Rename
multiply
method tomult
inSemimonoidal
typeclass - Generalize
Interpreted
typeclass - Define
Groupoid
typeclass - Remove
Measurable
typeclass - Rename
Applicative_
typeclass toApplicative
- Rename
Alternative_
typeclass toAlternative
- Rename
-<*>-
method of Applicative to<-*-
- Add functional dependencies to
Appliable
typeclass - Remove
-<$$>-
,-<<$>-
,-<$$>>-
in favor of<$$>
- Remove
-<$$$>-
in favor of<$$$>
- Remove
-<$$$$>-
in favor of<$$$$>
0.4.8
- Define
Zippable
type family and remove moves fromZipper
type alias - Add
!
infix operator as synonymous forrun
- Remove
Appliable
module - Generalize
Adaptable
typeclass - Generalize
Hoistable
typeclass - Define experimental notation for map methods of
Covariant
typeclass - Define experimental notation for map methods of
Contravariant
typeclass - Define
Tape
type synonymous for List and Stream zippers - Define
only
method ofSubstructure
typeclass - Change fixity and precedense of
!
method ofInterpreted
typeclass - Rename
*>-
Applicative
operator to-*-
- Rename
-+-
Alternative
operator to<-+-
- Define
-+-
method ofAlternative
typeclass - Define experimental
intensify
method as replacement ofzoom
- Define
#
type operator for consuming arguments - Define experimental
Possible
type class - Remove
magnify
andadjust
methods - Remove
zoom
method in favourintensify
- Rename
intensify
method tozoom
- Define
Betwixt
type family to avoid specifying intermediate categories - Define experimental
overlook
method - Remove
<$$$$>
,<$$$$||=
and=||$$$$>
operators - Define
Effectful
typeclass to delegate instance resolution forAdaptable
- Change order of type parameters in
Adaptable
typeclass
0.4.9
- Define
<-*-*-
method ofApplicative
typeclass - Define
-*-*-
method ofApplicative
typeclass - Define
TT
scheme where two effects are known - Use
TT
instead ofTU
inList
andBinary
- Define
Lensic
typeclass to combine different lenses - Use
TT
instead ofTU
inTape
instances - Rename Environment module and type to
Provision
- Rename
Configured
toProvided
- Rename
env
toprovided
- Rename
-<<-<<-
operator ofTraversable
to<<-<<-
- Rename
-*-
and-*-*-
to.-*-
and.-*-*-
- Define experimental
Kernel
typeclass - Remove
!.
,!..
,!..
operators inExponential
module - Move
<-|-|-
and<-|-|-|-
underCovariant
typeclass - Change priority of
:*:
operator - Change priority of
!
operator - Remove
$
operator in favor of!
0.5.0
- Define experimental
<-|-<-|-
,<-|->-|-
,>-|->-|-
,>-|-<-|-
methods - Define
>-|-|-
method inContravariant
typeclass - Remove
Bivariant
typeclass - Remove
Divariant
typeclass - Define
Turnover
wrapper for data structures that can that can be rotated indefinitely - Wrap left part of
Tape
intoReverse
- Rename
-+-
operator to.-+-
in Algebraic module - Define
Ability
umbrella module (like inStructure
) inInventory
- Define experimenal
Gettable
,Settable
andModifiable
typeclasses - Define
Some
umbrella module (like inStructure
) inInventory
- Remove
current
,replace
,modify
methods ofState
effect - Remove
view
method ofLens
- Remove
set
method ofLens
- Define experimental
Conditional
typeclass - Remove
?
method ofBoolean
datatype - Remove
over
method ofLens