eviefp / logic-in-haskellLinks
Classical Logic in Haskell
☆24Updated 5 months ago
Alternatives and similar repositories for logic-in-haskell
Users that are interested in logic-in-haskell are comparing it to the libraries listed below
Sorting:
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated last month
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Agda-style equational reasoning in Haskell☆54Updated 5 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Haskell implementation of nominal datatypes and functions☆44Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago