banacorn / agda-modeLinks
agda-mode on Atom
☆58Updated 4 years ago
Alternatives and similar repositories for agda-mode
Users that are interested in agda-mode are comparing it to the libraries listed below
Sorting:
- ☆84Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Agda language support for the Atom editor☆13Updated 4 years ago
- Programming library for Agda☆130Updated last year
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated last month
- ☆46Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Library of categories, with categorical constructions on them☆57Updated 2 years ago
- Language Server for Agda☆113Updated 2 weeks ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 4 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Where my everyday research happens☆55Updated 2 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- A simple GUI for Agda☆31Updated 9 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Paper and talk☆54Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- ☆32Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- A collection of Notes on GHC☆69Updated 6 years ago
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ☆86Updated last year