jonaprieto / agda-propLinks
A Library for Classical Propositional Logic in Agda
☆16Updated 6 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 4 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.☆20Updated 4 years ago
- The Agda Universal Algebra Library (html docs available at the url below)☆38Updated this week
- The Iowa Agda Library☆53Updated last month
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated 2 weeks ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- ☆93Updated 7 months ago
- Programming library for Agda☆133Updated last year
- Emacs mode for Lean☆68Updated 2 years ago
- Selected Papers of Dana S. Scott☆169Updated last year
- Algebraic Combinatorics in Coq☆39Updated 2 months ago
- Operational semantics, Type-based information flow security, Hoare logic, Verification conditions, and Separation logic in Agda for the I…☆18Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- H.O.T.T. using rewriting in Agda☆45Updated 3 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 2 weeks ago
- A formalized proof of a version of the initiality conjecture☆44Updated 5 years ago
- A TACtic library for Agda☆50Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A very simple coq layer for spacemacs☆37Updated 6 years 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
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆67Updated last week
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 3 years ago
- Total Parser Combinators in Agda☆132Updated 4 months ago