Zekt / Type-Embellishment
Experimenting on ornamentation in Agda via reflection.
☆12Updated last year
Alternatives and similar repositories for Type-Embellishment:
Users that are interested in Type-Embellishment are comparing it to the libraries listed below
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- ☆12Updated 5 years ago
- ☆18Updated 2 years ago
- Quasi-quoting library for agda☆17Updated 3 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- 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
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- my phd thesis☆26Updated 6 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆17Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- ☆11Updated 4 years ago
- ☆13Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- ☆21Updated 3 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated 8 months ago
- Agda to C compiler☆10Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 10 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ModTT in Agda☆11Updated 3 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- Organize mathematical thoughts☆19Updated last year