File: CHANGELOG.markdown

package info (click to toggle)
haskell-recursion-schemes 5.2.3-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 172 kB
  • sloc: haskell: 903; makefile: 4
file content (111 lines) | stat: -rw-r--r-- 3,119 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
## 5.2.3 [2024-06-12]

* Support GHC-9.10.
* Drop support for GHC-7.10 and earlier.

## 5.2.2.5 [2023-10-14]

* Support GHC-9.6 and GHC-9.8
* Support `th-abstraction-0.6.0.0` or later.

## 5.2.2.4 [2023-02-27]

* Support `th-abstraction-0.5.0.0` or later.

## 5.2.2.3

* Support GHC-9.4
* Workaround for https://gitlab.haskell.org/ghc/ghc/-/issues/18320, which was
  preventing code calling makeBaseFunctor from being profiled.

## 5.2.2.2

* Support GHC-9.0 and GHC-9.2

## 5.2.2.1

* Fix build issue regarding `Setup.hs`. See #120.

## 5.2.2
* More Mendler-style recursion-schemes: `mpara`, `mzygo`, `mana`, `mapo`, and
  `mfutu`.
* `makeBaseFunctor` no longer generates warnings when combined with
  DerivingStrategies.

## 5.2.1 [2020-10-04]
* Allow building with `template-haskell-2.17.0.0` (GHC 9.0).

## 5.2

* Add instances for `Tree` (from `containers`)
* Add some haddocks and basic examples
* Generalize the type of `makeBaseFunctor(With)`, such that
  it can take also `Dec`. This way you may supply context for `Recursive`
  and `Corecursive` instances.
* Depend on `data-fix` package for fixed point types.

## 5.1.3 [2019-04-26]
* Support `th-abstraction-0.3.0.0` or later.

## 5.1.2
* Make the `Generic`-based instances to also support data constructors with zero
  arguments (and datatypes with zero constructors).

## 5.1.1.1

* Invalid release

## 5.1.1

* Add `cotransverse`
* Add `Generic` based default implementation to `embed` and `project`.
  `Recursive` and `Corecursive` can be `DeriveAnyClass`-derived now,
  if you write the base functor by hand.

## 5.1
* Export gfutu
* `distGHisto`, `ghisto`, and `gchrono` now use `Cofree (Base t)`
* `distGFutu`, `gfutu`, and `gchrono` now use `Free (Base t)`
* Add `hoist`, `hoistMu` and `hoistNu`
* Add `transverse` and `cataA`

## 5.0.3 [2018-07-01]
* Make the Template Haskell machinery look through type synonyms.
* Avoid incurring some dependencies when using recent GHCs.

## 5.0.2
* Support GHC-8.2.1
* Fix Template Haskell derivation with non-default type renamer.
* Add `Recursive` and `Corecursive Natural` instances, with `Base Natural = Maybe`.

## 5.0.1
* Add `Data.Functor.Foldable.TH` module, which provides derivation of base functors via Template Haskell.

## 5
* Renamed `Foldable` to `Recursive` and `Unfoldable` to `Corecursive`. With `Foldable` in `Prelude` in GHC 7.10+, having a needlessly conflicting name seemed silly.
* Add support for GHC-8.0.1
* Use `Eq1`, `Ord1`, `Show1`, `Read1` to derive `Fix`, `Nu` and `Mu` `Eq`, `Ord` `Show` and `Read` instances
* Remove `Prim` data family. `ListF` as a new name for `Prim [a]`, with plenty of instances, e.g. `Traversable`.
* Export `unfix`
* Add chronomorphisms: `chrono` and `gchrono`.
* Add `distGApoT`

## 4.1.2
* Support for `free` 4.12.1

## 4.1.1
* Support for GHC 7.10
* Fixed `para`.

## 4.1
* Support for GHC 7.7+'s generalized `Typeable`.
* Faster `gapo` and `para` by exploiting sharing.

## 4.0

* Compatibility with `comonad` and `free` version 4.0

## 3.0

* Compatibility with `transformers` 0.3
* Resolved deprecation warnings caused by changes to `Data.Typeable`