package coq-ptsf

  1. Overview
  2. No Docs
Explicit Convertibility Proofs in Pure Type Systems

Install

Dune Dependency

www.andrew.cmu.edu Edit opam file Versions (6)

Authors

  1. F
    Floris van Doorn <fpv@andrew.cmu.edu> [http://www.andrew.cmu.edu/user/fpv/]
  2. H
    Herman Geuvers <herman@cs.ru.nl> [http://www.cs.ru.nl/~herman/]
  3. F
    Freek Wiedijk <freek@cs.ru.nl> [http://www.cs.ru.nl/~freek/]

Maintainers

  1. H
    Hugo.Herbelin@inria.fr

Sources

v8.10.0.tar.gz
md5=f5f68932253b4db6d1168b2cb41f7e09

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 theory

Published: 07 Dec 2019

Dependencies (3)

  1. coq-ptsatr >= "8.10" & < "8.11~"
  2. coq >= "8.10" & < "8.11~"
  3. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None