Source material for Certainty by Construction
-
Updated
Jan 20, 2024 - TeX
Source material for Certainty by Construction
Category theory applied to functional programming (undergraduate project)
The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of universal algebra in dependent type theory using the Agda proof assistant language.
Collaborative work on reversible computing
An implementation of scoped algebraic effects and handlers in Agda.
Translates Metis ATP proofs to the Agda code
Proving the correctness and performance of certain parallel algorithms
Compiling Concurrency Correctly—Verifying Software Transactional Memory
Reifying dynamical algebra: maximal ideals in countable rings, constructively
Free monoids take a price HIT
Notes about "An introduction to Finite Group Representation Theory using Agda"
Source code for the paper "Specifying and Verifying a Transformation of Recursive Functions into Tail-Recursive Functions"
📖 Word Processing in Groups
A formalisation of the pigeon theorem in UTT.
Add a description, image, and links to the agda topic page so that developers can more easily learn about it.
To associate your repository with the agda topic, visit your repo's landing page and select "manage topics."