Alternatives and similar repositories for theseus

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

• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 4 months ago
• robrix / path
  A lambda calculus to explore type-directed program synthesis.
  ☆85Updated 5 years ago
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 6 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆90Updated 3 years ago
• idris-community / inigo
  Inigo: A Package Manager for Idris2
  ☆62Updated 2 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆58Updated 6 years ago
• scott-fleischman / agda-from-nothing
  A workshop on learning Agda with minimal prerequisites.
  ☆85Updated 9 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 6 months ago
• VictorTaelin / Cedille-Core
  A minimal proof language.
  ☆207Updated 6 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• augustss / djinn
  Generate Haskell code from a type
  ☆136Updated 4 months ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆95Updated last year
• tonyday567 / numhask
  A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.
  ☆69Updated last week
• ekmett / coda
  A language experiment -- irc.freenode.net ##coda
  ☆163Updated last year
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆65Updated 6 years ago
• evincarofautumn / Toody
  A two-dimensional parser combinator library.
  ☆41Updated 8 years ago
• kowainik / treap
  Efficient implementation of the implicit treap data structure
  ☆62Updated 3 years ago
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆50Updated 5 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 7 years ago
• habit-lang / alb
  ☆39Updated 11 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago