This Agda library provides a cofixpoint combinator which does for productivity what well-founded recursion does for termination: It allows you to have arbitrary recursive calls in your corecursive functions if you can prove them terminating. Functions of this kind are sometimes called mixed recursive-corecursive, and their naive encoding is usually not obviously productive, so Agda rejects them. See the examples for some functions that are relatively easy to implement using this library.
- Agda 2.6.0.1; agda-stdlib 1.1
- Agda 2.6.0.1; agda-stdlib 1.2
- Agda 2.6.0; agda-stdlib 1.0
- Agda 2.6.0.1; agda-stdlib 1.1 (excluding examples!)
- Agda 2.5.4.2; agda-stdlib 0.17
- Agda 2.5.3; agda-stdlib 0.14 (excluding examples!)
- Agda 2.5.4; agda-stdlib 0.16
- Agda 2.5.3; agda-stdlib 0.14
- Agda 2.5.4; agda-stdlib 0.16 (excluding examples!)
- Agda 2.5.2; agda-stdlib 0.13
- Agda 2.5.3; agda-stdlib 0.14 (excluding examples!)
- Agda 2.5.4; agda-stdlib 0.16 (excluding examples!)
-
Move this folder to a path of your choice, for example
~/.agda/lib/wellfounded-coind. -
Add the following entry to your
~/.agda/libraries:~/.agda/lib/wellfounded-coind/wellfounded-coind.agda-lib(Substitute whatever path you chose in step 1.)
It should now be possible to import modules from this library in any of your Agda projects.
For details, read the packaging section of Agda's documentation.
There is currently no comprehensive API documentation (sorry!). This repository
contains a copy of my BSc thesis, paper.pdf, which describes the library in
some detail, both from a user's and implementor's perspective. Some usage
examples may also be found in examples/. Start with examples/Runs, which is
the simplest and most complete.
The 0.* series should be treated as unstable, meaning that anything can
change at any time. After that, we'll see; I'm not sure what would be a
sensible versioning policy for dependently typed languages.
This library occupies the Coinduction.WellFounded.** module namespace.