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.14.0.tar.gz
sha512=2a11f9bf6716975d5f436535b233abf8b190340d22f1ffc1939830744f111d3893a345d22588be9309f9fd6e1187696dd5286e299511e14e3fea337adde2c9b9
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-12-11Published: 11 Dec 2021
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page