formal proof of type preservation of the dictionary passing transform for system f
-
Updated
Mar 27, 2023 - Agda
formal proof of type preservation of the dictionary passing transform for system f
Formal proofs in mathematics/computer science/logic formalized in the Agda language. A hobby project I am working on in my free time.
Proofs for the paper "Risotto: A Dynamic Binary Translator for Weak Memory Model Architectures"
F-omega with interval kinds mechanized in Agda
mechanization for livelits paper, https://github.com/hazelgrove/livelits-paper
Messing around with propositional logic in Agda
Add a description, image, and links to the proofs topic page so that developers can more easily learn about it.
To associate your repository with the proofs topic, visit your repo's landing page and select "manage topics."