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
Sorting:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Where my everyday research happens☆52Updated last week
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Paper and talk☆54Updated last year
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A work-in-progress core language for Agda, in Agda☆52Updated 3 weeks ago
- ☆84Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- ☆47Updated 5 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Organization and planning for the Initial Types Club☆72Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- The Software Foundations book, in GHC☆82Updated 4 months ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 7 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago