jsiek / deduceLinks
A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.
☆117Updated last week
Alternatives and similar repositories for deduce
Users that are interested in deduce are comparing it to the libraries listed below
Sorting:
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆116Updated last week
- Hitchhiker's Guide to Logical Verification (2023 Edition)☆112Updated last year
- A graphical interactive proof assistant designed for education☆169Updated 11 months ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 4 months ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated 3 months ago
- Forge: A Tool and Language for Teaching Formal Methods☆91Updated last week
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated 3 weeks ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆180Updated 4 years ago
- 🦖 Implementations of various type inference algorithms. The new project is now at https://github.com/cu1ch3n/type-inference-zoo-frontend…☆151Updated 4 months ago
- Selected Papers of Dana S. Scott☆168Updated last year
- A simple raytracer written in Lean 4☆142Updated last year
- Lecture notes on realizability☆74Updated 8 months ago
- ☆45Updated 2 months ago
- Accompanying materials for "A Core Calculus for Documents"☆35Updated 2 years ago
- Functional Programming in Lean☆121Updated 3 weeks ago
- Staged compilation with dependent types☆184Updated 6 months ago
- Gallina to Bedrock2 compilation toolkit☆64Updated this week
- A toolkit for enforcing logical specifications on neural networks☆116Updated this week
- A compiler for functional programs on serialized data☆172Updated 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…☆38Updated last week
- A work-in-progress core language for Agda, in Agda☆59Updated last week
- A deterministic parser with fused lexing☆73Updated 2 years ago
- Language based on Rewriting Logic☆145Updated last week
- ☆39Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- Files associated with the course Interactive Theorem Proving at LMU SoSe 2024☆62Updated last year
- Type-checker for the λΠ-calculus modulo rewriting☆217Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆81Updated 8 years ago
- Modeling and Proving in Computational Type Theory☆117Updated 3 months ago