Experiments in formalizing refinement type systems in Coq
☆18Feb 7, 2016Updated 10 years ago
Alternatives and similar repositories for Refinements
Users that are interested in Refinements are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Formalization of Typed Assembly Language (TAL) in Coq☆18Mar 11, 2024Updated 2 years ago
- Mechanizing Types and Programming Languages using Beluga☆21May 29, 2020Updated 5 years ago
- quotient types in cubical Agda☆24Feb 4, 2019Updated 7 years ago
- A Coq plugin that implements exceptions in Coq☆13Jan 7, 2021Updated 5 years ago
- Proof checker for propositional logic☆16Jul 7, 2017Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago
- Hakyll support for Agda literate files☆19Jul 20, 2021Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- Formalizations of Gradually Typed Languages in Agda☆59Mar 2, 2026Updated 3 weeks ago
- some my implementation of content in PPA☆18Nov 3, 2020Updated 5 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆47Mar 3, 2026Updated 3 weeks ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Communication between Coq and SAT/SMT solvers☆165Mar 5, 2026Updated 2 weeks ago
- Session types in Idris2!☆27Dec 14, 2020Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 5 months ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆25Mar 3, 2026Updated 3 weeks ago
- 🍎 Play Bad Apple! with Haskell☆15Jul 22, 2022Updated 3 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20May 10, 2017Updated 8 years ago
- A formalization of category theory in cubical Agda☆58May 24, 2020Updated 5 years ago
- Minimal, efficient proof language☆15May 28, 2019Updated 6 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Aug 1, 2014Updated 11 years ago
- Library of Coq proof automation☆16Feb 15, 2022Updated 4 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Dec 22, 2020Updated 5 years ago
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Mar 18, 2015Updated 11 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- being the materials for Summer 2013's course☆113Apr 25, 2023Updated 2 years ago
- The SAW core language.☆55Jun 9, 2021Updated 4 years ago