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.6.0.tar.gz
md5=7e0a8fb54cc8528f80f998aaaa4adc08
Description
http://www.andrew.cmu.edu/user/fpv/ptsf/
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: 20 Nov 2018
Dependencies (3)
-
coq-ptsatr
>= "8.6" & < "8.7~"
-
coq
>= "8.6" & < "8.7~"
- ocaml
Dev Dependencies
None
Used by
None
Conflicts
None
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page