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:
- An implementation of "A Pretty Expressive Printer" in Racket☆28Updated last year
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- ☆137Updated 3 years ago
- Miller/pattern unification in Agda☆67Updated 11 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆55Updated 5 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
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- an implementation of stuck macros☆146Updated this week
- higher order dependently typed logic programing☆173Updated 7 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 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
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Updated 6 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Rules for writing academic papers and checking them using LTex-ls and LanguageTool☆19Updated 8 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Real number computation software☆128Updated 3 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆37Updated 3 weeks ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 weeks ago
- A categorical semantics library in Agda.☆16Updated 5 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆31Updated last year
- Fast, CommonMark-compliant Markdown parser written in Racket☆34Updated last year