jsiek / deduce
A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.
☆50Updated this week
Related projects: ⓘ
- A (formalised) general definition of type theories☆56Updated 3 years ago
- HoTT in Lean 3☆75Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆68Updated 3 years ago
- A Language with Dependent Data and Codata Types☆47Updated this week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆50Updated this week
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆44Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 6 months ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆31Updated last week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆77Updated 8 years ago
- A monadic library for symbolic evaluation☆51Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Formalizations of Gradually Typed Languages in Agda☆54Updated 2 weeks ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- A verified compiler for a lazy functional language☆31Updated this week
- EGraphs in OCaml☆59Updated 8 months ago
- Advent of Code 2020 solutions in Lean 4☆26Updated 3 years ago
- Fast equality saturation in Haskell☆75Updated 4 months ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆57Updated 2 weeks ago
- Coq Enhancement Proposals☆43Updated last week
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆43Updated 3 weeks ago
- ☆27Updated last year
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆33Updated 3 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆32Updated last week
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆50Updated 2 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆32Updated 2 months ago
- Agda lecture notes for the Functional Programming course at TU Delft☆114Updated 6 months ago
- Learn the Agda basics in three 2-hour sessions.☆53Updated 10 months ago