Alternatives and similar repositories for lexa

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

• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 8 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆75Updated 5 months ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆35Updated 2 months ago
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆67Updated 2 weeks ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 5 months ago
• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆45Updated 7 months ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆47Updated 3 years ago
• zydeco-lang / zydeco
  a proof-of-concept programming language based on call-by-push-value
  ☆56Updated last month
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆183Updated 5 months ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated this week
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆26Updated 2 weeks ago
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆29Updated 6 months ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 2 weeks ago
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆74Updated 2 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• andrejbauer / faux-type-theory
  ☆43Updated last month
• boyland / sasylf
  Educational Proof Assistant for Type Theory
  ☆75Updated last year
• favonia / hdtt2020-notes
  ☆36Updated 4 years ago
• CoqHott / logrel-coq
  Logical Relation for MLTT in Coq
  ☆27Updated this week
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆63Updated last year
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated 2 weeks ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 6 months ago
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• TiarkRompf / reachability
  ☆53Updated last week
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆74Updated 8 months ago
• effect-handlers / effect-handlers-bench
  Benchmark repository of polyglot effect handler examples
  ☆29Updated 2 months ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated last month