medovina / natty
Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of development.
☆35Updated this week
Alternatives and similar repositories for natty:
Users that are interested in natty are comparing it to the libraries listed below
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 5 months ago
- Demo for dependent types + runtime code generation☆67Updated last month
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆48Updated 5 months ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆58Updated this week
- Graphical rewriting for diagrammatic reasoning in monoidal categories in Lean4☆25Updated 9 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- Lecture notes on realizability☆73Updated last month
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- ☆30Updated last month
- A toy example of a verified compiler.☆28Updated 2 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆23Updated last year
- WIP collections library for Lean 4☆32Updated 3 weeks ago
- Anders: Cubical Type Checker☆24Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Type Checking in Lean 4☆28Updated 2 weeks ago
- sockets for Lean 4☆18Updated 8 months ago
- Ground Zero: Lean 4 HoTT Library☆56Updated 3 months ago
- SDL2 bindings for lean☆21Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆68Updated 3 weeks ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆64Updated 11 months ago
- Topos theory in lean☆58Updated 4 years ago
- A Testing Framework for Lean☆51Updated 2 weeks ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆62Updated last week
- A repository for material from the reading group on NbE☆17Updated last year
- A work-in-progress core language for Agda, in Agda☆46Updated last week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆26Updated 2 years ago
- Natural language tactics to teach mathematics using Lean 4☆66Updated last week
- A bottom-up approach to a verified implementation of MLTT☆17Updated last month
- maze game encoded in Lean 4 syntax☆53Updated 3 months ago
- Experiments with SAT solvers with proofs in Lean 4☆55Updated 9 months ago