lexi-lambda / blackboardLinks
A (very) unfinished OpenType Math layout and rendering engine in Racket
☆59Updated last year
Alternatives and similar repositories for blackboard
Users that are interested in blackboard are comparing it to the libraries listed below
Sorting:
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- An implementation of "A Pretty Expressive Printer" in Racket☆28Updated last year
- Mirror of Epigram 2, by Conor McBride, et al.☆55Updated 5 years ago
- Miller/pattern unification in Agda☆67Updated 3 weeks ago
- ☆137Updated 3 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- a self-hosting lambda calculus compiler☆37Updated 7 months ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- 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
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆22Updated 5 years ago
- A formalization of System Fω in Agda☆20Updated 9 months ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- ☆62Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Logic for story telling!☆35Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A verified compiler for a lazy functional language☆36Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Updated 7 months ago
- Command-like expressions for real infinite-precision calculations☆55Updated 3 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year