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
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆166Updated last month
- Programming library for Agda☆129Updated 10 months ago
- A small implementation of higher-order unification☆189Updated 7 years ago
- Total Parser Combinators in Agda☆130Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆115Updated 2 weeks ago
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- Tutorial for LiquidHaskell☆78Updated 9 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Compiling Agda code to readable Haskell☆189Updated 3 weeks ago
- Let GHC prove program equations for you☆145Updated 6 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆148Updated 3 years ago
- Lecture notes on univalent foundations of mathematics with Agda☆228Updated last year
- SPLV20 course notes☆112Updated 2 years ago
- A curated list of awesome Coq frameworks, libraries and software.☆234Updated 3 weeks ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆55Updated 4 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Haskell bindings to Microsoft's Z3 API (unofficial).☆59Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆84Updated 7 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago