gallais / generic-syntaxLinks
A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
☆77Updated 3 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:
- Where my everyday research happens☆55Updated 3 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A TACtic library for Agda☆49Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 months ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆84Updated 8 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- The Prettiest Printer☆35Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- ☆48Updated last month
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago