☆17Oct 16, 2018Updated 7 years ago
Alternatives and similar repositories for reflection-tutorial
Users that are interested in reflection-tutorial are comparing it to the libraries listed below
Sorting:
- ☆12Jul 8, 2019Updated 6 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ☆18May 10, 2022Updated 3 years ago
- A TACtic library for Agda☆51Sep 14, 2024Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆21Oct 15, 2023Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Jul 10, 2015Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Implementation of sprintf for Coq☆19Apr 6, 2020Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Jan 12, 2021Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Category theory formalized in cubical agda☆21Feb 16, 2020Updated 6 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Jun 22, 2021Updated 4 years ago
- ☆21Apr 15, 2018Updated 7 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago