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
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Dependently Typed Lambda Calculus in Haskell☆114Updated 4 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
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- Programming library for Agda☆126Updated 6 months ago
- An experimental type checker for a modal dependent type theory.☆109Updated 4 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- A language based on homotopy type theory with an interval☆85Updated 9 years ago
- Tutorial for LiquidHaskell☆75Updated 5 months ago
- ☆84Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Total Parser Combinators in Agda☆126Updated last year
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- SPLV20 course notes☆108Updated 2 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- Fake dependent types in Haskell using singletons☆290Updated last week
- higher order dependently typed logic programing☆170Updated 6 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Coq formalizations of functional languages.☆143Updated 4 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- Categories parametrized by morphism equality, in Agda☆149Updated 5 years ago
- Extensional capabilities and deriving combinators☆214Updated 8 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago