InitialTypes / ClubLinks
Organization and planning for the Initial Types Club
☆73Updated 2 years ago
Alternatives and similar repositories for Club
Users that are interested in Club are comparing it to the libraries listed below
Sorting:
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- SPLV20 course notes☆108Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆114Updated this week
- Agda bindings to SMT-LIB2 compatible solvers.☆98Updated 7 months ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Total Parser Combinators in Agda☆128Updated 2 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 6 years ago
- Library of the ##dependent distributed research support group☆113Updated 10 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Programming library for Agda☆128Updated 9 months ago
- ☆84Updated 7 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A language based on homotopy type theory with an interval☆85Updated 10 years ago
- Categorical logic from a categorical point of view☆78Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 2 weeks ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago