Alternatives and similar repositories for blackboard

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

• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• sorawee / pretty-expressive
  An implementation of "A Pretty Expressive Printer" in Racket
  ☆28Updated last year
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆57Updated 5 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 9 months ago
• lexi-lambda / mini-ml
  An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)
  ☆21Updated 6 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• stchang / macrotypes
  ☆138Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated 2 months ago
• SuzanneSoy / type-expander
  Type expanders (i.e. type-level functions) for Typed/Racket
  ☆16Updated 4 years ago
• clf / celf
  ☆62Updated 6 years ago
• ComputerAidedLL / click-and-collect
  A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml
  ☆24Updated 9 months ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆32Updated last year
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• theoremprover-museum / theoremprover-museum.github.io
  ☆56Updated 8 months ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 2 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆116Updated 5 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• corazza / game-idris
  A 2D platformer in Idris, a dependently-typed purely functional programming language
  ☆25Updated 5 years ago
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆48Updated 8 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• JacquesCarette / TheoriesAndDataStructures
  Showing how some simple mathematical theories naturally give rise to some common data-structures
  ☆39Updated last year
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆80Updated 4 months ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated last month
• andrejbauer / alg
  Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.
  ☆84Updated 4 years ago
• xieyuheng / cat
  A categorical semantics library in Agda.
  ☆16Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago