joom / dilimLinks
A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.
☆17Updated 2 years ago
Alternatives and similar repositories for dilim
Users that are interested in dilim are comparing it to the libraries listed below
Sorting:
- A formalization of System Fω in Agda☆20Updated last month
- ☆17Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- A template for you to implement Hazelnut yourself☆22Updated 6 months ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- 🩺 A library for compiler diagnostics☆52Updated 2 months ago
- An implementation of "A Pretty Expressive Printer" in Racket☆28Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Interactive holes for Lean 4☆22Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Updated 10 months ago
- Demo for dependent types + runtime code generation☆72Updated 11 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- Probabilistic music composition in Idris2☆16Updated 3 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Updated last week
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- Anders: Cubical Type Checker☆23Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Accompanying materials for "A Core Calculus for Documents"☆36Updated 2 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago