Minimalistic dependent type theory with syntactic metaprogramming
-
Updated
Jun 18, 2024 - Agda
Minimalistic dependent type theory with syntactic metaprogramming
Left-leaning red-black trees in Agda (insertion and deletion) with static ordering and balancing invariants
An Agda library for turning equations into bijections using the translation method
Messing around with propositional logic in Agda
Variations on Noetherianness
Agda from Nothing: Order in the Types
Dependently Typed Programming with Finite Sets
Answers to the exercises on the book Programming Language Foundations in Agda
Reimplementations of functional data structures (mostly as presented by Okasaki) in a dependently typed language
Functional Reactive Programming in Agda, adapting [Conal Elliott's Push-Pull Functional Reactive Programming](http://conal.net/papers/push-pull-frp/push-pull-frp.pdf).
Formal proofs in mathematics/computer science/logic formalized in the Agda language. A hobby project I am working on in my free time.
A work-in-progress core language for Agda, in Agda
A TACtic library for Agda
A workshop on learning Agda with minimal prerequisites.
The Agda Universal Algebra Library (html docs available at the url below)
Lecture notes on univalent foundations of mathematics with Agda
Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
Add a description, image, and links to the dependent-types topic page so that developers can more easily learn about it.
To associate your repository with the dependent-types topic, visit your repo's landing page and select "manage topics."