Alternatives and similar repositories for rebound

Users that are interested in rebound are comparing it to the libraries listed below

• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated last week
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆25Updated this week
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆35Updated 7 years ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆14Updated last year
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated 3 weeks ago
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆54Updated last month
• maxsnew / grammars-and-semantic-actions
  Intrinsic Verification of Formal Grammar Theory
  ☆26Updated last month
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• frex-project / idris-frex
  ☆48Updated last month
• msp-strath / cs410-advanced-functional-programming
  CS410 "Advanced Functional Programming"
  ☆26Updated 4 months ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆28Updated 3 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆66Updated 2 weeks ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 4 months ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 7 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 6 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆32Updated last month
• tomdjong / MGS-domain-theory
  Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…
  ☆46Updated last year
• um-catlab / cubical-categorical-logic
  Extensions to cubical for categorical logic/type theory
  ☆32Updated last week
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 5 months ago
• AliasQli / tactics
  ☆16Updated 3 years ago