alhassy / AgdaCheatSheet
Basics of the dependently-typed functional language Agda ^_^
☆39Updated 3 years ago
Alternatives and similar repositories for AgdaCheatSheet:
Users that are interested in AgdaCheatSheet are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- Paper and talk☆54Updated last year
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Where my everyday research happens☆52Updated this week
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- ☆30Updated 6 years ago
- ☆47Updated 5 months ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- ☆29Updated 2 years ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- A tutorial on how Agda infers things☆41Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ☆36Updated 3 years ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- ☆84Updated 7 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- ☆23Updated 10 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago