Alternatives and similar repositories for gentle-intro-to-reflection:

Users that are interested in gentle-intro-to-reflection are comparing it to the libraries listed below

• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆96Updated 5 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆54Updated 2 years ago
• mikeshulman / catlog
  Categorical logic from a categorical point of view
  ☆77Updated last year
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆62Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 6 months ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated 3 weeks ago
• gebner / hott3
  HoTT in Lean 3
  ☆78Updated 4 years ago
• felixwellen / synthetic-zariski
  Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos
  ☆56Updated this week
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆182Updated this week
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆126Updated 6 months ago
• felixwellen / DCHoTT-Agda
  Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality
  ☆53Updated 2 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆36Updated 4 years ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆35Updated 2 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆71Updated 3 weeks ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 7 months ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆55Updated 5 months ago