medovina / nattyView external linksLinks
Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of development.
☆38Feb 8, 2026Updated last week
Alternatives and similar repositories for natty
Users that are interested in natty are comparing it to the libraries listed below
Sorting:
- Many proofs of the Pythagoras theorem - Lean 4☆10Dec 1, 2023Updated 2 years ago
- Normalization-by-evaluation in miniKanren☆25Feb 26, 2023Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- Experiments with Realizability in Univalent Type Theory☆19Oct 21, 2024Updated last year
- A table library for Idris 2☆15Oct 25, 2022Updated 3 years ago
- 🦖 Implementations of various type inference algorithms. The new project is now at https://github.com/cu1ch3n/type-inference-zoo-frontend…☆153Jun 22, 2025Updated 7 months ago
- File format and optimizer for programs encoded in binary lambda calculus☆17Jan 21, 2024Updated 2 years ago
- The 峨眉 (EMei) JIT/AOT backend framework.☆18Nov 19, 2024Updated last year
- ☆16Mar 11, 2022Updated 3 years ago
- A formal consistency proof of Quine's set theory New Foundations☆79Jun 18, 2025Updated 7 months ago
- HoTT Book formalisations in Rzk.☆20Dec 15, 2023Updated 2 years ago
- Let's rethink how we interact with Agda☆18Nov 18, 2022Updated 3 years ago
- Lean course materials for Brown CS 22, Spring 2023☆20Nov 20, 2023Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆37Mar 17, 2025Updated 10 months ago
- A proof assistant for higher-dimensional type theory☆234Jan 26, 2026Updated 2 weeks ago
- Mechanizations of Type Theories☆33Jan 15, 2026Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 2 months ago
- Demo for dependent types + runtime code generation☆72Feb 18, 2025Updated 11 months ago
- Distributions of Agda executable compiled into WebAssembly.☆25Nov 9, 2025Updated 3 months ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- ☆22Feb 13, 2024Updated 2 years ago
- ☆16Updated this week
- Sources of the EuroProofNet web site.☆13Feb 2, 2026Updated last week
- being an operating system for typechecking processes☆131Oct 7, 2025Updated 4 months ago
- A verified polyhedral scheduling validator in Coq.☆23Oct 2, 2024Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- egraph on top of sqlite☆13Mar 8, 2022Updated 3 years ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Dec 19, 2023Updated 2 years ago
- Verified NbE via gluing in Agda☆11May 19, 2024Updated last year
- ☆16Aug 2, 2023Updated 2 years ago
- Stronger types for a few Typed Racket operators☆11Jan 25, 2024Updated 2 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 4 months ago
- Tree-automata-based run-time type constraints for miniKanren☆14Aug 3, 2023Updated 2 years ago
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆13Aug 19, 2024Updated last year
- An automated theorem prover for intuitionistic propostional logic☆14Sep 21, 2020Updated 5 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆48Sep 1, 2022Updated 3 years ago
- ☆10May 27, 2025Updated 8 months ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 6 months ago