Alternatives and similar repositories for inference-in-agda

Users that are interested in inference-in-agda are comparing it to the libraries listed below

• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 5 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆59Updated this week
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆74Updated 8 months ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago
• frex-project / idris-frex
  ☆51Updated 2 months ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆52Updated 3 months ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆50Updated last year
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆104Updated 3 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆29Updated last week
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆57Updated 6 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• tomdjong / MGS-domain-theory
  Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…
  ☆47Updated last year
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆103Updated 3 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 7 months ago
• morphismtech / distributors
  Distributors - Unifying Parsers, Printers & Grammars
  ☆57Updated this week
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆55Updated 2 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 8 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆73Updated 6 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆75Updated 6 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 3 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 2 months ago
• DSLsofMath / FPClimate
  PhD course on Functional Programming and Climate Impact Research
  ☆50Updated 2 months ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 3 months ago