package coq-recursive-definition
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
ML-like recursive definitions
Install
Dune Dependency
Authors
Maintainers
Sources
v8.6.0.tar.gz
md5=d4df2f356bf846f882d8b2dadf38c3a9
Description
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.
Tags
keyword: recursive functions keyword: well-foundedness category: Miscellaneous/Coq Extensions date: 2002Published: 20 Nov 2018
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page