jwiegley / coq-haskellLinks
A library for formalizing Haskell types and functions in Coq
☆170Updated last year
Alternatives and similar repositories for coq-haskell
Users that are interested in coq-haskell are comparing it to the libraries listed below
Sorting:
- Convert Haskell source code to Coq source code☆281Updated 4 years ago
- Programming library for Agda☆130Updated last year
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆167Updated last month
- Coq formalizations of functional languages.☆145Updated 5 years ago
- The People's Refinement Logic☆228Updated 2 years ago
- A small implementation of higher-order unification☆191Updated 8 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆149Updated 4 years ago
- A proof assistant for general type theories☆308Updated last month
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- Lecture notes on univalent foundations of mathematics with Agda☆230Updated last year
- Total Parser Combinators in Agda☆132Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Link to preprints for ICFP'17 and colocated events☆136Updated 7 years ago
- An Open Encyclopedia of Proof Systems☆119Updated 3 years ago
- A curated list of awesome Coq frameworks, libraries and software.☆235Updated this week
- Hadrian: a new build system for the Glasgow Haskell Compiler. Now merged into the GHC tree!☆208Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆115Updated this week
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Let GHC prove program equations for you☆146Updated 6 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 6 months ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆56Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Horn Clause Constraint Solving for Liquid Types☆152Updated 3 weeks ago
- A very simple coq layer for spacemacs☆37Updated 6 years ago