An axiom-free formalization of category theory in Coq for personal study and practical work
-
Updated
Nov 27, 2024 - Coq
An axiom-free formalization of category theory in Coq for personal study and practical work
Lambda syntax for Scala EDSLs
Julia package for building composable DSLs with multiple interpretations.
A type theory for unbiased cartesian closed categories.
Port of Bartosz Milewski's C++ monadic IO to typescript. Created a mix of Maybe/IO/Promise, which is a fully functional CCC environment, allowing for recursion to code more complex operations, and inherits all the convenient properties of its components.
Add a description, image, and links to the cartesian-closed-category topic page so that developers can more easily learn about it.
To associate your repository with the cartesian-closed-category topic, visit your repo's landing page and select "manage topics."