Alternatives and similar repositories for theseus

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

• scott-fleischman / agda-from-nothing
  A workshop on learning Agda with minimal prerequisites.
  ☆86Updated 9 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 6 months ago
• VictorTaelin / Cedille-Core
  A minimal proof language.
  ☆208Updated 6 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆132Updated 5 years ago
• idris-community / inigo
  Inigo: A Package Manager for Idris2
  ☆62Updated 2 years ago
• VictorTaelin / absal-ex
  Absal ex
  ☆58Updated last year
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• Bodigrim / logict
  A continuation-based backtracking logic programming monad
  ☆91Updated 9 months ago
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 6 years ago
• evincarofautumn / Toody
  A two-dimensional parser combinator library.
  ☆41Updated 8 years ago
• ekmett / coda
  A language experiment -- irc.freenode.net ##coda
  ☆163Updated last year
• robrix / path
  A lambda calculus to explore type-directed program synthesis.
  ☆85Updated 5 years ago
• tweag / linear-types
  Drafts, notes and resources for adding linear typing to GHC.
  ☆78Updated 5 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 7 months ago
• augustss / djinn
  Generate Haskell code from a type
  ☆140Updated 6 months ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆144Updated 3 years ago
• eayus / sirdi
  Package manager for Idris
  ☆37Updated 3 years ago
• Helium4Haskell / helium
  The Helium compiler, Helium-as-a-library, and the texthint interpreter
  ☆98Updated 9 months ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• agda-attic / agda-frp-js
  ECMAScript back end for Functional Reactive Programming in Agda
  ☆103Updated 7 years ago
• moonad-archive / Formality-JavaScript
  An implementation of the Formality language in JavaScript
  ☆71Updated 6 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• ollef / rock
  Build system
  ☆124Updated last year