anuyts / agda-sessions
Learn the Agda basics in three 2-hour sessions.
☆56Updated last year
Alternatives and similar repositories for agda-sessions:
Users that are interested in agda-sessions are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Where my everyday research happens☆52Updated this week
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- ☆84Updated 7 years ago
- ☆47Updated 4 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Paper and talk☆53Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 6 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- A tutorial on how Agda infers things☆41Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- The Software Foundations book, in GHC☆82Updated 3 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- ☆30Updated 6 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 3 weeks ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago