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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Dependently typed programming language written in Haskell☆22Feb 14, 2022Updated 4 years ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Sep 3, 2020Updated 5 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Implementation of Polymorphic Gradual Typing☆12Sep 16, 2018Updated 7 years ago
- A formalisation of the Calculus of Constructions☆70Jul 24, 2024Updated last year
- A cost-aware logical framework, embedded in Agda.☆78Feb 23, 2026Updated last month
- quotient types in cubical Agda☆24Feb 4, 2019Updated 7 years ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 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
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- Benchmark repository of polyglot effect handler examples☆34Aug 21, 2025Updated 7 months ago
- ☆19Nov 24, 2025Updated 4 months ago
- Logical Relation for MLTT in Coq☆30Jan 14, 2026Updated 2 months ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- 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
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆26Updated this week
- Cyclic theorem prover for equalitional reasoning using egraphs☆27Oct 24, 2023Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Low-overhead effect management for concrete monads☆37Mar 25, 2022Updated 3 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45May 31, 2022Updated 3 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Jun 29, 2023Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Mar 16, 2021Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Aug 21, 2025Updated 7 months ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last month
- 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
- Deadlock freedom by type checking☆20Jun 2, 2023Updated 2 years ago
- A tool to create immutable algebraic data structures and visitors for Java (such as abstract syntax trees).☆16Jan 12, 2026Updated 2 months ago
- Formalization of Typed Assembly Language (TAL) in Coq☆18Mar 11, 2024Updated 2 years ago
- UCI-compatible chess engine in OCaml.☆14Apr 20, 2025Updated 11 months ago
- Optimizing Abstract Abstract Machines☆31Apr 6, 2017Updated 8 years ago
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 3 months ago
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Jan 10, 2023Updated 3 years ago
- An Android app to browse GitHub repositories☆15Nov 17, 2025Updated 4 months ago