Alternatives and similar repositories for Dependent-Binary-Lambda-Calculus

Users that are interested in Dependent-Binary-Lambda-Calculus are comparing it to the libraries listed below

• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆23Updated 5 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 6 months ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 7 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆15Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆34Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 4 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 5 months ago
• norm2782 / NanoProlog
  ☆17Updated 2 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 4 years ago
• 8l / asif
  A Self-Interpreter for F-omega
  ☆16Updated 9 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• 5outh / Molecule
  A tiny statically typed programming language
  ☆18Updated 10 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 2 months ago
• uwplse / magic
  Demystifying the magic of supertactics
  ☆13Updated 3 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆48Updated 4 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago