package coq-ptsf
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Explicit Convertibility Proofs in Pure Type Systems
Install
Dune Dependency
Authors
Maintainers
Sources
v8.5.0.tar.gz
md5=29e7294dfdd89c6e120b3b812938ad20
Description
Formalization of the proof that PTS and PTS with explicit convertibility proofs (PTSf) are equivalent.
Tags
keyword:pure type systems keyword:judgmental equality keyword:explicit equality proofs keyword:proof relevance category:Mathematics/Logic/Type theoryPublished: 07 Jun 2016
Dependencies (3)
-
coq-ptsatr
= "8.5.0"
-
coq
>= "8.5" & < "8.6~"
- ocaml
Dev Dependencies
None
Used by
None
Conflicts
None
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page