jonaprieto / agda-propLinks
A Library for Classical Propositional Logic in Agda
☆16Updated 5 years ago
Alternatives and similar repositories for agda-prop
Users that are interested in agda-prop are comparing it to the libraries listed below
Sorting:
- Meta-programming utilities for Agda.☆20Updated 2 months ago
- The Agda Universal Algebra Library (html docs available at the url below)☆36Updated 10 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- An Emacs mode for working with Agda code in an Org-mode like fashion, more or less.☆19Updated 3 years ago
- ☆90Updated 5 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated 8 months ago
- A TACtic library for Agda☆50Updated last year
- Lecture notes on realizability☆74Updated 7 months ago
- The Iowa Agda Library☆49Updated 3 weeks ago
- HoTT in Lean 3☆82Updated 5 years ago
- Algebraic Combinatorics in Coq☆39Updated this week
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Programming library for Agda☆132Updated last year
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- H.O.T.T. using rewriting in Agda☆45Updated 3 years ago
- Formalizing linear algebra in Agda by representing matrices as functions☆26Updated last year
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆66Updated last week
- Selected Papers of Dana S. Scott☆165Updated last year
- Verified C programming in Agda☆16Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- An equational theorem prover based on Knuth-Bendix completion☆55Updated 3 weeks ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 4 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago