Graded Dependent Type systems
☆25Jun 28, 2023Updated 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:
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Dependently typed programming language written in Haskell☆22Feb 14, 2022Updated 4 years ago
- A formalisation of the Calculus of Constructions☆70Jul 24, 2024Updated last year
- quotient types in cubical Agda☆24Feb 4, 2019Updated 7 years ago
- A cost-aware logical framework, embedded in Agda.☆77Feb 23, 2026Updated last week
- Implementation of Polymorphic Gradual Typing☆12Sep 16, 2018Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 3 weeks ago
- UCI-compatible chess engine in OCaml.☆14Apr 20, 2025Updated 10 months ago
- Benchmark repository of polyglot effect handler examples☆34Aug 21, 2025Updated 6 months ago
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Sep 3, 2020Updated 5 years ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Logical Relation for MLTT in Coq☆30Jan 14, 2026Updated last month
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- ☆19Nov 24, 2025Updated 3 months ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Jun 29, 2023Updated 2 years ago
- A formalization of the theory behind the mugen library☆19Jun 24, 2024Updated last year
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- Formalization of Typed Assembly Language (TAL) in Coq☆18Mar 11, 2024Updated last year
- ☆16Mar 11, 2022Updated 3 years ago
- Racket Equivalence Graph Library☆19May 24, 2022Updated 3 years ago
- A graduate seminar on SMT solving and solver-aided systems☆29Jul 17, 2022Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Mar 16, 2021Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Mar 15, 2022Updated 3 years ago
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Jun 18, 2022Updated 3 years ago
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 2 months ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated last month
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 6 months ago
- Low-overhead effect management for concrete monads☆37Mar 25, 2022Updated 3 years ago
- Deadlock freedom by type checking☆20Jun 2, 2023Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- ♾️ A library for universe levels and universe polymorphism☆37Nov 21, 2025Updated 3 months ago