ecavallo / pttLinks
Experimental type-checker for internally parametric type theory
☆32Updated 5 months ago
Alternatives and similar repositories for ptt
Users that are interested in ptt are comparing it to the libraries listed below
Sorting:
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated 10 months ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- my phd thesis☆26Updated last year
- Coherence typechecker for infinity categories☆20Updated this week
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆23Updated 3 years ago
- ☆16Updated 2 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆15Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- ☆18Updated 3 years ago
- 🦠An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year