eviefp / logic-in-haskell
Classical Logic in Haskell
☆24Updated last month
Alternatives and similar repositories for logic-in-haskell:
Users that are interested in logic-in-haskell are comparing it to the libraries listed below
- Linear map categories in Agda☆5Updated 2 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
- Session types in Idris2!☆27Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- the dynabook but for haskell☆23Updated 5 years ago
- Agda-style equational reasoning in Haskell☆53Updated last month
- Quantitative Type Theory implementation☆54Updated 3 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- An efficient graph library for Haskell☆39Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Automatic piecewise-mutable references for your types☆42Updated 4 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- Session Types with Priority in Linear Haskell☆26Updated 10 months ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- I/O utilities and datasets for algebraic-graphs☆14Updated 2 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆43Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆48Updated 3 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Edit is a monad for rewriting things.☆23Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆26Updated 4 months ago
- An in-memory full text search engine library. It lets you run full-text queries on a collection of your documents.☆49Updated 3 months ago