jespercockx / reflection-tutorialLinks
☆17Updated 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:
- ☆18Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months 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
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Mtac in Agda☆28Updated 4 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 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'…☆12Updated 9 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Multimode simple type theory as an Agda library.☆23Updated last year
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago