https://github.com/jonsterling/coq-guarded-computational-type-theory
https://github.com/jonsterling/coq-guarded-computational-type-theory
dependent-types formalization guarded-recursion
Last synced: about 1 year ago
JSON representation
- Host: GitHub
- URL: https://github.com/jonsterling/coq-guarded-computational-type-theory
- Owner: jonsterling
- Created: 2017-09-13T18:24:28.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2018-04-15T23:11:15.000Z (about 8 years ago)
- Last Synced: 2025-04-20T13:37:14.849Z (about 1 year ago)
- Topics: dependent-types, formalization, guarded-recursion
- Language: Coq
- Size: 421 KB
- Stars: 21
- Watchers: 10
- Forks: 1
- Open Issues: 3
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
This is the Coq formalization of Sterling and Harper's "Guarded Computational
Type Theory".
# Hacking
To build this Coq development, ensure that you have Coq 8.7 installed. I
recommend that you install Coq in the standard way through
[OPAM](https://opam.ocaml.org/), and my instructions are not guaranteed to work
otherwise (they may work, but I have no way to double check).
opam install coq.8.7.1+1
Now, you are ready to build this development. Simply run `make`. To build the
coqdoc (HTML rendering of the proofs), run `make html`.