Alternatives and similar repositories for lambda

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

• ilya-klyuchnikov / sc-mini
  SC Mini is a "minimal" positive supercompiler
  ☆46Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆90Updated 3 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆31Updated 4 years ago
• scott-fleischman / agda-from-nothing
  A workshop on learning Agda with minimal prerequisites.
  ☆85Updated 9 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆53Updated 8 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• VictorTaelin / calculus-of-constructions
  Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.
  ☆114Updated 8 years ago
• agda-attic / agda-frp-js
  ECMAScript back end for Functional Reactive Programming in Agda
  ☆104Updated 7 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 6 years ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated 8 months ago
• andrejbauer / marshall
  Real number computation software
  ☆125Updated 2 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• VictorTaelin / absal-rs
  ☆35Updated 6 years ago
• jvranish / MiniKanrenT
  An implementation of miniKanren in Haskell
  ☆78Updated 12 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year