Alternatives and similar repositories for lambdapi

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

• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆149Updated 3 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 3 years ago
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆145Updated 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 6 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 7 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆95Updated 2 years ago
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆110Updated 6 years ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆167Updated this week
• OPLSS / introduction-to-algebraic-effects-and-handlers
  Introduction to algebraic effects and handlers
  ☆96Updated 7 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• ucsd-progsys / liquidhaskell-tutorial
  Tutorial for LiquidHaskell
  ☆79Updated 11 months ago
• scott-fleischman / agda-from-nothing
  A workshop on learning Agda with minimal prerequisites.
  ☆85Updated 9 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆85Updated 2 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆209Updated 5 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• llelf / icfp2020-papers
  ICFP 2020 papers. Crowd-sourced
  ☆91Updated 5 years ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆142Updated 6 years ago
• jsiek / B629-denotational
  Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
  ☆73Updated 7 years ago
• dlicata335 / hott-agda
  ☆84Updated 8 years ago
• ilya-klyuchnikov / sc-mini
  SC Mini is a "minimal" positive supercompiler
  ☆46Updated 4 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆174Updated 7 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 3 months ago