agda / agda-finite-proverLinks
Library for proving propositions quantified over finite sets
☆14Updated 2 years ago
Alternatives and similar repositories for agda-finite-prover
Users that are interested in agda-finite-prover are comparing it to the libraries listed below
Sorting:
- A TACtic library for Agda☆49Updated 11 months ago
- Fast equality saturation in Haskell☆86Updated last month
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Total Parser Combinators in Agda☆132Updated 3 weeks ago
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- A tutorial on how Agda infers things☆61Updated last month
- Distributors - Unifying Parsers, Printers & Grammars☆25Updated 3 weeks ago
- Paper and talk☆54Updated 2 years ago
- Agda category theory library for denotational design☆52Updated 2 weeks ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 4 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆74Updated 2 months ago
- ☆48Updated 2 weeks ago
- Staged push/pull fusion with typed Template Haskell☆62Updated last year
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- Meta-programming utilities for Agda.☆19Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.☆21Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago