Type level algebraic "proofs" using lens combinators
-
Updated
Jul 26, 2019 - Haskell
Type level algebraic "proofs" using lens combinators
Lightweight formal verification system developed to support research on usability of automated proof verification tools.
Homework from Mathematical Logic 2019 course in ITMO University.
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% 🎉
Functional programming 🖥️ Haskell assignments for Functional Programming module: CSU34016
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."