lexi-lambda / blackboard
A (very) unfinished OpenType Math layout and rendering engine in Racket
☆54Updated 3 months ago
Related projects ⓘ
Alternatives and complementary repositories for blackboard
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 8 months ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated 9 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆25Updated this week
- ☆22Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- The Prettiest Printer☆35Updated 9 months ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A 2D platformer in Idris, a dependently-typed purely functional programming language☆25Updated 4 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆34Updated 3 weeks ago
- a simple total pure functional language, eventually to have powerful static checking and optimization☆33Updated last month
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- A SKI combinators interpreter written in assembly☆17Updated 4 years ago
- Type expanders (i.e. type-level functions) for Typed/Racket☆17Updated 3 years ago
- A property-based testing library for Racket.☆29Updated 6 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- ☆28Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Yoneda lemma in every known language☆17Updated last year
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- A simple functional programming language.☆21Updated 3 years ago