bennn / pierce-categoriesLinks
Exercises from "Basic Category Theory for Computer Scientists" by Benjamin Pierce.
☆16Updated 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:
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Introduction to algebraic effects and handlers☆95Updated 6 years ago
- ☆84Updated last year
- Library of Unix effects for Coq.☆23Updated 5 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- ☆84Updated 7 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- Categories parametrized by morphism equality, in Agda☆150Updated 5 years ago
- Programming library for Agda☆129Updated 10 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated this week
- Agda bindings to SMT-LIB2 compatible solvers.☆99Updated 8 months ago
- A simple GUI for Agda☆31Updated 9 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- A modular sat/smt solver with proof output.☆99Updated last year
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- Higher-kinded programming in OCaml☆183Updated last year
- Dependent Object Types (DOT), bottom up☆87Updated 3 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last month