joom / hezarfen
a theorem prover for intuitionistic propositional logic in Idris, with metaprogramming features
☆119Updated 6 years ago
Alternatives and similar repositories for hezarfen:
Users that are interested in hezarfen are comparing it to the libraries listed below
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 2 years 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
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Programming library for Agda☆126Updated 6 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- Categories parametrized by morphism equality, in Agda☆149Updated 5 years ago
- Library of the ##dependent distributed research support group☆112Updated 8 months ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- A language based on homotopy type theory with an interval☆85Updated 9 years ago
- An experimental type checker for a modal dependent type theory.☆109Updated 4 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Total Parser Combinators in Agda☆126Updated last year
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- The Art of the Propagator. See also:☆172Updated 11 months 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 3 years ago
- A small implementation of higher-order unification☆186Updated 7 years ago
- Summer school on programming in Agda☆68Updated last year
- Real number computation software☆123Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- The People's Refinement Logic☆229Updated 2 years ago
- Extensional capabilities and deriving combinators☆214Updated 8 months ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆76Updated 4 years ago
- SPLV20 course notes☆108Updated 2 years ago