cyberglot / faethLinks
algebraic typechecking and elaboration of type systems
☆13Updated 6 months ago
Alternatives and similar repositories for faeth
Users that are interested in faeth are comparing it to the libraries listed below
Sorting:
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 2 years ago
- A TOML parser for Idris 2☆17Updated last year
- ☆13Updated 3 weeks ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Updated 2 years ago
- A formalization of System Fω in Agda☆19Updated 6 months ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- Practical type inference for arbitrary-rank types☆11Updated 6 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last week
- 🩺 A library for compiler diagnostics☆47Updated last week
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Anders: Cubical Type Checker☆23Updated last year
- My Agda blog/lab/playground☆13Updated 2 weeks ago
- A simple λProlog interpreter☆20Updated 3 years ago
- ☆17Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- 🦠 Reusable components based on algebraic effects☆51Updated last week
- Experimental normalisation via scheme☆12Updated 4 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Organize mathematical thoughts☆20Updated last year
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- ☆16Updated 6 months ago
- ☆12Updated 6 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- My Attempt at System Fω with Row-Polymorphism☆30Updated 4 years ago