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.
  ☆32Updated this week
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆71Updated 7 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 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
  ☆57Updated 2 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 6 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆75Updated 5 months ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆40Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• blntk / sfpl
  A simple functional programming language.
  ☆22Updated 4 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 6 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• lexa-lang / lexa
  ☆37Updated last month
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 7 months ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• nomeata / lean-wf-induct
  ☆17Updated last year
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 7 months ago