Lift algebraic structures from setoids to quotient sets
-
Updated
May 13, 2012
Lift algebraic structures from setoids to quotient sets
Some pretty old experiments in intuitionistic logic using Agda
Examples to get some practice on functional programming and formal proofs
An Agda syntax highlighting to gedit.
Source code of Agda mode on CodeMirror Next.
Provably correct indexed binary search tree
Notes about "An introduction to Finite Group Representation Theory using Agda"
This is a formalization of dialectica spaces.
formal proof of type preservation of the dictionary passing transform for system f
Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
Left-leaning red-black trees in Agda (insertion and deletion) with static ordering and balancing invariants
Formalizing the clone theory in type theory and Agda
Messing around with propositional logic in Agda
Agda development of the paper "Set-Theoretic and Type-Theoretic Ordinals Coincide"
Proving the correctness and performance of certain parallel algorithms
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."