Alternatives and similar repositories for LC-interpreter:

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

• dunhamsteve / newt
  A toy dependent typed language.
  ☆28Updated 2 weeks ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆34Updated 3 weeks ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆70Updated 3 months ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆35Updated last year
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆56Updated 10 months ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 2 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
  ☆28Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 8 months ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 5 months ago
• frex-project / idris-frex
  ☆47Updated 3 months ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆54Updated 3 years ago
• forked-from-1kasper / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆66Updated 3 weeks ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆19Updated 5 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago