herbie-fp / regraphLinks
Racket Equivalence Graph Library
☆19Updated 3 years ago
Alternatives and similar repositories for regraph
Users that are interested in regraph are comparing it to the libraries listed below
Sorting:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Benchmark repository of polyglot effect handler examples☆24Updated 2 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated 9 months ago
- Lean4 backend using `libgccjit`!☆11Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Updated 4 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- Graded Dependent Type systems☆24Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 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
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- ☆55Updated 2 months ago
- Two-Level Type Theory☆28Updated 5 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- ☆22Updated 9 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 7 years ago
- An implementation of scoped algebraic effects and handlers in Agda.☆12Updated 4 years ago
- SPSC: A Small Positive Supercompiler☆35Updated last year
- Generation of abstract binding trees☆28Updated 8 months ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Updated 2 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 8 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- The Alms Programming Language☆44Updated 6 years ago