ML-like recursive definitions. This module provides a facility to define recursive functions in an ML-like style, giving a fixpoint equation, a variant and a well-founded relation. A pure function is then generated, together with a theorem giving the fixpoint equation. THIS IS MAINLY A TEST CONTRIB, BEFORE INTEGRATION IN COQ.

opam install coq-recursive-definition.8.6.0

- homepage
- https://github.com/coq-contribs/recursive-definition
- license
- LGPL 2.1
- bugs tracker
- https://github.com/coq-contribs/recursive-definition/issues
- dependencies
- coq (>= 8.6 & < 8.7~)
- source
- https://github.com/coq-contribs/recursive-definition/archive/v8.6.0.tar.gz
- package
- https://github.com/coq/opam-coq-archive/tree/master/released/packages/coq-recursive-definition/coq-recursive-definition.8.6.0