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
almost-full-8.18.0.tar.gz
sha512=c6871611ae19c34dfd6c27f86c29c9b38cff126cc2631684357a3cf04bb5d38e8aed0d4178f26f9c584e16cda7c6c6d1422996c0b057fe7fd8f5470662d284b3
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:2023-12-28Published: 28 Dec 2023
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page