medovina / nattyLinks
Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of development.
☆37Updated this week
Alternatives and similar repositories for natty
Users that are interested in natty are comparing it to the libraries listed below
Sorting:
- Demo for dependent types + runtime code generation☆71Updated 7 months ago
- maze game encoded in Lean 4 syntax☆60Updated 2 months ago
- Lecture notes on realizability☆74Updated 6 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆68Updated 11 months ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 2 months ago
- Anders: Cubical Type Checker☆23Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 3 months ago
- Write C shims from within Lean code.☆72Updated 2 months ago
- A book about functional programming in Lean☆42Updated last year
- Experiments with SAT solvers with proofs in Lean 4☆60Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- A Seamless, Interactive Tactic Learner and Prover for Coq☆74Updated last month
- A monadic library for symbolic evaluation☆69Updated 2 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- Selected Papers of Dana S. Scott☆162Updated last year
- A toy example of a verified compiler.☆29Updated 4 months ago
- # A simple variable binding library based on well-scoped indices and environments☆17Updated last week
- Lean type-checker written in Scala.☆37Updated 3 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆65Updated this week
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- A toolkit for enforcing logical specifications on neural networks☆110Updated this week
- A work-in-progress core language for Agda, in Agda☆55Updated 3 weeks ago
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆66Updated last week
- A Testing Framework for Lean☆59Updated this week
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Ground Zero: Lean 4 HoTT Library☆66Updated this week
- Canonical is a performant sound and complete type inhabitation solver for dependent type theory.☆69Updated last week
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago