bennn / pierce-categoriesLinks
Exercises from "Basic Category Theory for Computer Scientists" by Benjamin Pierce.
☆17Updated 3 years ago
Alternatives and similar repositories for pierce-categories
Users that are interested in pierce-categories are comparing it to the libraries listed below
Sorting:
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- Introduction to algebraic effects and handlers☆98Updated 7 years ago
- A collection of resources for learning type theory.☆99Updated 9 years ago
- being the lecture materials and exercises for the 2017/18 session of CS410 Advanced Functional Programming at the University of Strathcly…☆264Updated 7 years ago
- Total Parser Combinators in Agda☆132Updated 4 months ago
- The home of the Glamorous Glambda interpreter☆228Updated 8 months ago
- Strongly-typed System F in Haskell☆119Updated 3 years ago
- A library for formalizing Haskell types and functions in Coq☆170Updated 2 years ago
- Programming library for Agda☆133Updated last year
- Examples of Dependently-typed programs in Haskell☆307Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 8 months ago
- Sample code from "Type Driven Development with Idris"☆164Updated 8 years ago
- ☆84Updated last year
- The category theory by example book☆59Updated last month
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- SPLV20 course notes☆114Updated 3 years ago
- Categories parametrized by morphism equality, in Agda☆152Updated 6 years ago
- A minimalistic, elegant and powerful approach to working with graphs in a functional programming language☆200Updated 4 years ago
- Fake dependent types in Haskell using singletons☆292Updated last month
- The People's Refinement Logic☆228Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- A friendly effect system for Haskell☆235Updated last year
- Library of the ##dependent distributed research support group☆117Updated last year
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago