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:
- Programming library for Agda☆129Updated 10 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- SPLV20 course notes☆112Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Total Parser Combinators in Agda☆130Updated 2 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Library of the ##dependent distributed research support group☆114Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Where my everyday research happens☆53Updated last month
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Tutorial for LiquidHaskell☆78Updated 9 months ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- ☆84Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated 11 months ago