jsiek / deduce
A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.
☆113Updated this week
Alternatives and similar repositories for deduce:
Users that are interested in deduce are comparing it to the libraries listed below
- A simple raytracer written in Lean 4☆134Updated 11 months ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆125Updated last year
- An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax☆100Updated this week
- A collection of tools for writing technical documents that mix Coq code and prose.☆254Updated last month
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Lecture notes on realizability☆72Updated last month
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆170Updated 3 years ago
- Selected Papers of Dana S. Scott☆161Updated 10 months ago
- A formal consistency proof of Quine's set theory New Foundations☆69Updated last week
- Hitchhiker's Guide to Logical Verification (2023 Edition)☆99Updated last year
- A graphical interactive proof assistant designed for education☆167Updated 5 months ago
- Agda lecture notes for the Functional Programming course at TU Delft☆125Updated last year
- Functional Programming in Lean☆77Updated this week
- A Verified Compiler for Gallina, Written in Gallina☆148Updated this week
- Lean 4 kernel / 'external checker' written in Lean 4☆97Updated 2 months ago
- A proof assistant for higher-dimensional type theory☆178Updated this week
- ☆31Updated 6 months ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆113Updated this week
- A work-in-progress core language for Agda, in Agda☆51Updated this week
- Logic and Mechanized Reasoning☆101Updated 2 months ago
- A deterministic parser with fused lexing☆72Updated last year
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- Programming with pure lambda calculus☆105Updated this week
- 😎TT☆225Updated last year
- Files associated with the course Interactive Theorem Proving at LMU SoSe 2024☆62Updated 8 months ago
- A compiler for functional programs on serialized data☆160Updated last week
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆35Updated this week
- Implementation of the λΠ-calculus modulo rewriting☆206Updated this week
- Staged compilation with dependent types☆171Updated this week