joom / hezarfen
a theorem prover for intuitionistic propositional logic in Idris, with metaprogramming features
☆120Updated 6 years ago
Alternatives and similar repositories for hezarfen:
Users that are interested in hezarfen are comparing it to the libraries listed below
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 4 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 9 years ago
- A language based on homotopy type theory with an interval☆85Updated 10 years ago
- Programming library for Agda☆127Updated 8 months ago
- ☆84Updated 7 years ago
- Coq formalizations of functional languages.☆143Updated 4 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- A language experiment -- irc.freenode.net ##coda☆162Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- higher order dependently typed logic programing☆171Updated 6 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- A continuation-based backtracking logic programming monad☆89Updated 5 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Total Parser Combinators in Agda☆126Updated last year
- Summer school on programming in Agda☆68Updated last year
- Implementation of cryptographic primitives using Idris☆121Updated 7 years ago
- The Art of the Propagator. See also:☆172Updated last year
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago