Alternatives and similar repositories for LC-interpreter

Users that are interested in LC-interpreter are comparing it to the libraries listed below

• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 7 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 8 months ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆58Updated 2 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated 2 weeks ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆75Updated 6 months ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 3 months ago
• lexa-lang / lexa
  ☆39Updated 3 months ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• hide-kawabata / traf
  A proof tree viewer that works with Coq through Proof General
  ☆28Updated 4 years ago
• favonia / hdtt2020-notes
  ☆36Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 5 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆58Updated this week
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• blntk / sfpl
  A simple functional programming language.
  ☆22Updated 4 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• Guest0x0 / trebor
  an implementation of Observational Type Theory (OTT) and more
  ☆29Updated 3 years ago
• osa1 / mincaml
  A MinCaml compiler implemented in Rust
  ☆44Updated 2 years ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 2 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆27Updated 3 weeks ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated last week