joom / hezarfen
a theorem prover for intuitionistic propositional logic in Idris, with metaprogramming features
☆119Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for hezarfen
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆74Updated 6 years ago
- The Disco Discus Compiler☆174Updated 5 years ago
- Dependently Typed Lambda Calculus in Haskell☆112Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Categories parametrized by morphism equality, in Agda☆148Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- Programming library for Agda☆121Updated 3 months ago
- A small implementation of higher-order unification☆182Updated 7 years ago
- Convert lambda expressions to CCC combinators☆146Updated 8 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- A language based on homotopy type theory with an interval☆84Updated 9 years ago
- Lean theorem prover version 0.2 (it supports standard and HoTT modes)☆121Updated 2 years ago
- Implementation of cryptographic primitives using Idris☆121Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Let GHC prove program equations for you☆145Updated 6 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 months ago
- Coq formalizations of functional languages.☆141Updated 4 years ago
- The People's Refinement Logic☆227Updated last year
- Distributed programming language that desugars to Morte☆91Updated 2 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comon…☆155Updated 3 years ago
- The Art of the Propagator. See also:☆170Updated 7 months ago
- compiler with polyhedral optmization for a lazy functional programming language☆67Updated 7 years ago
- A language experiment -- irc.freenode.net ##coda☆163Updated 7 months ago
- Fake dependent types in Haskell using singletons☆287Updated 3 weeks ago