Explaining category theory by example
☆10Jun 30, 2017Updated 8 years ago
Alternatives and similar repositories for category-theory-by-example
Users that are interested in category-theory-by-example are comparing it to the libraries listed below
Sorting:
- Mechanizing Types and Programming Languages using Beluga☆21May 29, 2020Updated 5 years ago
- ☆16Jun 17, 2017Updated 8 years ago
- UDP-only netcat implementation with OCaml / MirageOS☆14Mar 21, 2017Updated 8 years ago
- ☆12Oct 3, 2020Updated 5 years ago
- Yet another haskell term rewriting library☆18Aug 27, 2025Updated 6 months ago
- this repo demonstrates calling purescript from javascript through the output.☆11Jul 23, 2017Updated 8 years ago
- A partial implementation of Protocol Buffers in Idris☆32Aug 12, 2017Updated 8 years ago
- ES6 style template strings for Purescript☆27Dec 31, 2022Updated 3 years ago
- Working through Okasaki's "Functional Datastructures" in PureScript☆14Nov 9, 2016Updated 9 years ago
- Category Theory in Agda☆13Jan 16, 2018Updated 8 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- ☆15May 28, 2016Updated 9 years ago
- GRIN Haskell backend stripped out from JHC. (GRIN from scratch: https://github.com/grin-tech/grin)☆16Dec 13, 2018Updated 7 years ago
- Spacemacs Layer for LiquidHaskell☆13Jun 10, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- My attempt to better understand both Coq and Category Theory by formalizing the latter in the former.☆14Aug 3, 2019Updated 6 years ago
- Simple architectures for type-safe state management in React inspired by Elm, Thermite and Halogen☆34Jan 6, 2017Updated 9 years ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Jan 19, 2017Updated 9 years ago
- ☆10Jan 24, 2016Updated 10 years ago
- Companion code for "Why Dependent Types Matter" paper.☆60Jun 14, 2018Updated 7 years ago
- A project comparing the Tagless Final approach with the Free Monad one, using the Monix's Task as the target monad☆14May 20, 2017Updated 8 years ago
- Transformerless monads for Puresript☆22Sep 26, 2018Updated 7 years ago
- Relational programming for PureScript☆17Jan 5, 2017Updated 9 years ago
- Leibniz Equality☆19Jun 7, 2018Updated 7 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Dec 31, 2020Updated 5 years ago
- Linear Algebra Done...Lean☆19Jan 15, 2018Updated 8 years ago
- Lambda calculus at the type level.☆20Jul 22, 2017Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Runtime Extended Inference for json data.☆22Jan 4, 2023Updated 3 years ago
- ☆21May 9, 2017Updated 8 years ago
- ATS-Postiats-contrib is primarily for packages contributed to ATS-Postiats☆51Aug 3, 2020Updated 5 years ago
- Visual tool for stepwise evaluation of simple Haskell expressions☆20Dec 20, 2019Updated 6 years ago
- ☆50Dec 21, 2017Updated 8 years ago
- Web Workers with ReasonML☆23Aug 30, 2023Updated 2 years ago
- A slack bot that will fetch type signatures via Hoogle☆21May 11, 2016Updated 9 years ago
- QuickCheck powered law tests for PureScript's core typeclasses.☆26Oct 17, 2022Updated 3 years ago
- A Prelude with names from category theory☆51Sep 5, 2016Updated 9 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20May 10, 2017Updated 8 years ago
- learning cuda☆20Jun 27, 2016Updated 9 years ago