InitialTypes / ClubLinks
Organization and planning for the Initial Types Club
☆74Updated 3 years ago
Alternatives and similar repositories for Club
Users that are interested in Club are comparing it to the libraries listed below
Sorting:
- SPLV20 course notes☆114Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Programming library for Agda☆133Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 3 months ago
- Strongly-typed System F in Haskell☆119Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Total Parser Combinators in Agda☆132Updated 3 months ago
- Library of the ##dependent distributed research support group☆117Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Where my everyday research happens☆55Updated last month
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- A tutorial on how Agda infers things☆63Updated 4 months ago
- apkg - package manager for Agda☆38Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 3 months ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Categorical logic from a categorical point of view☆81Updated 2 years ago