gergoerdi / generic-syntaxLinks
Library implementation of "Generic description of well-scoped, well-typed syntaxes"
☆12Updated 7 years ago
Alternatives and similar repositories for generic-syntax
Users that are interested in generic-syntax are comparing it to the libraries listed below
Sorting:
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ☆16Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Bring fusion to everyone☆14Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 10 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 weeks ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- NbE course @ Chalmers☆28Updated last year
- ☆17Updated 7 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- ☆18Updated 3 years ago