joom / hezarfenLinks
a theorem prover for intuitionistic propositional logic in Idris, with metaprogramming features
☆121Updated 6 years ago
Alternatives and similar repositories for hezarfen
Users that are interested in hezarfen are comparing it to the libraries listed below
Sorting:
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- Programming library for Agda☆130Updated 11 months ago
- 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
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Categories parametrized by morphism equality, in Agda☆151Updated 6 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- Tutorial for LiquidHaskell☆78Updated 10 months ago
- A small implementation of higher-order unification☆189Updated 8 years ago
- A language experiment -- irc.freenode.net ##coda☆164Updated last year
- Drafts, notes and resources for adding linear typing to GHC.☆78Updated 5 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Updated 8 years ago
- The Art of the Propagator. See also:☆174Updated last year
- Total Parser Combinators in Agda☆132Updated this week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- ☆84Updated 7 years ago
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆162Updated 4 years ago
- A workshop on learning Agda with minimal prerequisites.☆86Updated 9 years ago