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
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 9 months ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 8 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆76Updated 7 months ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆36Updated last week
• blntk / sfpl
  A simple functional programming language.
  ☆22Updated 4 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• favonia / hdtt2020-notes
  ☆36Updated 4 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 9 months ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated last week
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆33Updated 2 weeks ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆55Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 8 months ago
• lexa-lang / lexa
  ☆41Updated 3 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆27Updated last month
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year