Alternatives and similar repositories for anders

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

• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆29Updated 3 months ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 months ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆24Updated last year
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated last month
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆31Updated this week
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 11 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆41Updated 2 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆32Updated 2 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆36Updated last week
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆15Updated 2 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated last month
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 3 years ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆56Updated last week
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆34Updated 8 years ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 3 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 10 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• JonasHoefer / poset-type-theory
  Experimental implementation of a Cubical Type Theory modeled by presheaves over posets
  ☆12Updated last year