sweirich / graded-haskell
Graded Dependent Type systems
☆23Updated last year
Related projects ⓘ
Alternatives and complementary repositories for graded-haskell
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆22Updated 2 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Session types in Idris2!☆27Updated 3 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆33Updated 5 years ago
- quotient types in cubical Agda☆22Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A type theory with native support for Polynomial Functors.☆38Updated last year
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆19Updated last year
- Algebraic proof discovery in Agda☆32Updated 2 years ago
- A formalization of the theory behind the mugen library☆15Updated 5 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 7 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆29Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 5 months ago
- 🪆 A Staged Type Theory☆34Updated last year
- A verified compiler for a lazy functional language☆32Updated last month
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year