AliasQli / tactics
☆16Updated 3 years ago
Alternatives and similar repositories for tactics:
Users that are interested in tactics are comparing it to the libraries listed below
- An extension of the NbE algorithm to produce computational traces☆21Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- ☆21Updated 3 years ago
- my phd thesis☆26Updated 8 months ago
- Quasi-quoting library for agda☆17Updated 5 months ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- ☆29Updated 2 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 11 months ago
- ☆16Updated last year
- ModTT in Agda☆11Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Mechanizations of Type Theories☆28Updated 2 months ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- ☆13Updated last month
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Verified C programming in Agda☆16Updated 4 years ago
- ☆12Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Notes (and implementation) of unification with binders☆14Updated last month
- Experiments with Realizability in Univalent Type Theory☆18Updated 6 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year