Guest0x0 / pruning-tutor
a tutorial implementation on an elaborator of a dependently typed language with pruning
☆23Updated 2 years ago
Alternatives and similar repositories for pruning-tutor:
Users that are interested in pruning-tutor are comparing it to the libraries listed below
- Elaboration with inductive types☆16Updated last year
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆44Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 3 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- 🦖 Implementations of various type inference algorithms. Online interactive playground is available at https://zoo.cuichen.cc/☆24Updated this week
- ☆16Updated 3 years ago
- Conference on Homotopy Type Theory 2023☆13Updated last year
- 🧊 A Elbereth Gilthoniel / silivren penna míriel! 🌟☆20Updated 2 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Logical Relation for MLTT in Coq☆24Updated this week
- ShiTT is a toy proof assistant. (This project will be rewritten soon)☆33Updated 4 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆12Updated 7 months ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆35Updated last month
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- ☆30Updated 5 months ago
- a proof-of-concept programming language based on Call-by-push-value☆53Updated last month
- high-performance cubical evaluation☆70Updated 4 months ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Deadlock freedom by type checking☆19Updated last year
- Distributions of Agda executable compiled into WebAssembly.☆16Updated 3 weeks ago
- PL conference deadline countdowns☆57Updated last week
- Setoid type theory implementation☆38Updated last year
- ModTT in Agda☆11Updated 3 years ago
- mirror of A simple type-theoretic language: Mini-TT☆38Updated 8 years ago
- ☆22Updated last year
- ☆36Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated last month