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 implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- A cost-aware logical framework, embedded in Agda.☆64Updated this week
- Intrinsic Verification of Formal Grammar Theory☆26Updated last week
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- ☆13Updated 3 months 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.☆22Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Quasi-quoting library for agda☆17Updated 8 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- quotient types in cubical Agda☆24Updated 6 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A style guide for Coq☆18Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- 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
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Denotational semantics based on graph and filter models☆23Updated 7 months ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago