TODO
☆23Oct 10, 2015Updated 10 years ago
Alternatives and similar repositories for formal-logic
Users that are interested in formal-logic are comparing it to the libraries listed below
Sorting:
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- doom☆17Mar 8, 2016Updated 9 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- Regular expression matching in Idris☆11Apr 27, 2016Updated 9 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- A Language and its compiler on Ethereum Virtual Machine☆14Dec 17, 2018Updated 7 years ago
- ☆20Aug 13, 2024Updated last year
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Idris, but it's C☆24May 25, 2018Updated 7 years ago
- Tactic for polynomial manipulations☆13Jan 29, 2026Updated last month
- Deriving Storable instances using GHC.Generics☆16Apr 9, 2022Updated 3 years ago
- Accepted papers for ICFP 2014☆119May 19, 2016Updated 9 years ago
- playing with hyperfunctions☆16May 2, 2021Updated 4 years ago
- Dependently typed core calculus with erasure☆19Aug 31, 2021Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- Haskell Type Level Example Programs☆28Nov 30, 2017Updated 8 years ago
- Agda-style equational reasoning in Haskell☆54Jan 18, 2026Updated last month
- Fully proved small C functions (examples for verification course).☆17Jun 26, 2017Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Lenses in Coq☆17Oct 7, 2022Updated 3 years ago
- An algebra for Matrix Expressions written in Maude☆24Oct 23, 2012Updated 13 years ago
- A little utility to derive lenses and prisms for data types in PureScript☆39Apr 11, 2017Updated 8 years ago
- An implementation of Functional Reactive Programming☆41Mar 2, 2015Updated 11 years ago
- Preprocessor for typesetting Haskell sources with LaTeX☆104Dec 30, 2025Updated 2 months ago
- Collection of Idris snippets☆24Dec 23, 2025Updated 2 months ago
- ☆21Mar 21, 2022Updated 3 years ago
- A small bifunctor library for idris☆21Dec 28, 2020Updated 5 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Mar 31, 2015Updated 10 years ago
- This repository has been moved to https://gitlab.com/twittner/swagger☆18Apr 29, 2015Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- A port of the gloss library from Haskell to Idris☆23Jul 9, 2018Updated 7 years ago
- probabilistic programming in Haskell☆17Aug 26, 2016Updated 9 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Some numerical optimization methods implemented in Haskell☆47Jun 24, 2020Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago