File: CHANGELOG.markdown

package info (click to toggle)
haskell-recursion-schemes 5-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 92 kB
  • ctags: 2
  • sloc: haskell: 462; makefile: 4
file content (28 lines) | stat: -rw-r--r-- 877 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
## 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`