Towards richer dependent types for DOT
-
Updated
Mar 4, 2021 - Coq
Towards richer dependent types for DOT
This is a work in progress of https://plfa.github.io/ course.
The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of universal algebra in dependent type theory using the Agda proof assistant language.
Locally nameless implementation of the Holy Types and Programming Languages using TLC!
Programming Language Theory
Working through Andras Kovacs' elaboration zoo in Javascript
Learning Lean (and Type Theory) for the ZFC-Headed Pure Mathematician
Type theoretical proofs in Agda proving the Ring of Integers.
Add a description, image, and links to the typetheory topic page so that developers can more easily learn about it.
To associate your repository with the typetheory topic, visit your repo's landing page and select "manage topics."