banacorn / agda-mode

Related projects: ⓘ

• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆90Updated 6 years ago
• coq-io / system
  Library of Unix effects for Coq.
  ☆23Updated 4 years ago
• markokoleznik / agda-writer
  A simple GUI for Agda
  ☆31Updated 8 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆68Updated 5 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆121Updated last month
• dlicata335 / hott-agda
  ☆82Updated 7 years ago
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆77Updated 4 years ago
• myuon / ghc-compiler-notes
  A collection of Notes on GHC
  ☆69Updated 5 years ago
• coq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆42Updated 8 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆51Updated 2 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated last year
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆120Updated 3 weeks ago
• scmlab / gcl
  backend of Guabao
  ☆11Updated 2 weeks ago
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆78Updated 4 months ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆51Updated 5 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆53Updated 3 weeks ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆93Updated last year
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆56Updated 5 years ago
• slindley / effect-handlers
  ☆81Updated 4 months ago
• banacorn / language-agda
  Agda language support for the Atom editor
  ☆13Updated 4 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆94Updated 5 months ago
• valis / hoq
  A language based on homotopy type theory with an interval
  ☆84Updated 9 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆55Updated 5 months ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆104Updated 9 years ago
• konn / type-natural
  Type-level well-kinded natural numbers.
  ☆33Updated 3 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆104Updated last year
• coq / stdlib2
  ☆39Updated 8 months ago
• agda / agda-language-server
  Language Server for Agda
  ☆100Updated 9 months ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆69Updated last year
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated last year