Lower-Kinded Optics for OCaml
-
Updated
Oct 9, 2022 - OCaml
Lower-Kinded Optics for OCaml
Learning to Count Isomorphisms with Graph Neural Networks
🪞 Reflecta 🪞 - Unleash the Power of Optics in your code!
Optics for the impoverished
Proof of concept optics library for Standard ML
Verifying if two graphs in JSON format are isomorphic
An implementation of the Radix-2 Decimation-In-Time (DIT) form of the Cooley-Tukey FFT algorithm, as well as its inverse. The algorithm is used to multiply 2 polynomials and compute the convolution of 2 vectors in O(nlogn) time.
Add a description, image, and links to the isomorphisms topic page so that developers can more easily learn about it.
To associate your repository with the isomorphisms topic, visit your repo's landing page and select "manage topics."