package coq-almost-full
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Almost-full relations in Coq for proving termination
Install
Dune Dependency
Authors
Maintainers
Sources
v8.13.0.tar.gz
sha512=86e6b1fb6e2aea66ede180385bd1d0eed7184c29cbfa24b4e07b61cd16f3e809ef20359c4c4af0a27ff8559502c662b0d025b7adad954b0a3efbc9ac0befc9a4
Description
Coq development of almost-full relations, including the Ramsey Theorem, useful for proving termination.
Tags
category:Computer Science/Data Types and Data Structures keyword:Ramsey theorem keyword:termination keyword:almost-full relations keyword:well-founded relations logpath:AlmostFull date:2021-08-01Published: 01 Aug 2021
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page