Agda is a dependently typed programming language / interactive theorem prover.
-
Updated
Aug 7, 2024 - Haskell
Agda is a dependently typed programming language / interactive theorem prover.
An experimental proof assistant based on a type theory for synthetic ∞-categories.
A Super Kawaii Dependently Typed Programming Language
A non-interactive proof assistant using the Haskell type system
Type-level well-kinded natural numbers.
A small NuPRL style proof assistant
A Teeny Type Theory
Simple LCF-style proof assistant for ZFC
A simple proof assistant based on string rewriting (work in progress)
Simple proof assistant for classical and intuitionistic G3-style sequent calculi
Proof assistant for Hilbert style proof systems including predicate calculus and epsilon calculus
A small, dependently typed language
A functional prototype of a Galois-connection based proof assistant
A graphical interactive proof assistant designed for education. My contributions: applying rules by elimination, proofs by induction, proofs by cases, multi-axiom element and misc css styling. Honours report grade: 76% 🎉
Add a description, image, and links to the proof-assistant topic page so that developers can more easily learn about it.
To associate your repository with the proof-assistant topic, visit your repo's landing page and select "manage topics."