justinpombrio / synless
Synless is a language-agnostic tree editor.
☆20Updated 2 weeks ago
Related projects ⓘ
Alternatives and complementary repositories for synless
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆14Updated 6 years ago
- implementation of Pure Type Systems (PTS) in Rust.☆51Updated 7 years ago
- Abstract binding tree code generator☆36Updated 8 years ago
- A miniKanren implementation in Rust☆36Updated 8 years ago
- A general-purpose language inspired by Scheme and Rust and Haskell and ML and cetera☆19Updated 2 years ago
- ☆36Updated 6 years ago
- A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety☆24Updated 10 years ago
- Fungi: Typed incremental computation with names☆66Updated 5 years ago
- ☆23Updated 6 years ago
- A safe and efficient target language for functional compilers☆19Updated 6 years ago
- Rust implementation of Ray Tracing in One Weekend☆12Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- An error-tolerant live programming environment (my Master's thesis)☆18Updated 2 years ago
- A type checker for the Lean theorem prover☆39Updated 3 years ago
- ☆34Updated 5 years ago
- Type-Level Programming in Rust☆26Updated 2 years ago
- Implicit Drop/move protection for Rust (linear types)☆12Updated 9 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.☆15Updated 11 months ago
- A dependent type system built entirely in Rust's trait system (WIP).☆24Updated 6 years ago
- A proof that Idris is pacman complete☆8Updated 7 years ago
- BDD-based implementation of Datalog☆36Updated 4 years ago
- A coq plugin to deal with commutative diagrams☆19Updated 4 months ago
- A dependently typed programming language, and verification tool☆26Updated 8 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- (Nominal) Adapton in OCaml☆50Updated 8 years ago
- A programming language somewhat resembling cellular processes.☆33Updated 2 years ago