sweirich / graded-haskellLinks
Graded Dependent Type systems
☆25Updated 2 years ago
Alternatives and similar repositories for graded-haskell
Users that are interested in graded-haskell are comparing it to the libraries listed below
Sorting:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- quotient types in cubical Agda☆24Updated 6 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated last month
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Formalization of type theory☆22Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 9 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Quasi-quoting library for agda☆18Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- A formalization of the theory behind the mugen library☆19Updated last year
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Denotational semantics based on graph and filter models☆23Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- my phd thesis☆26Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- A style guide for Coq☆18Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago