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.
☆38Updated 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☆72Updated 9 months ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 5 months ago
- Lecture notes on realizability☆74Updated 8 months ago
- Programming Language Foundations in Lean☆44Updated 3 months ago
- A book about functional programming in Lean☆44Updated last year
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Type Checking in Lean 4☆32Updated 4 months ago
- A work-in-progress core language for Agda, in Agda☆59Updated last week
- maze game encoded in Lean 4 syntax☆65Updated 4 months ago
- A type theory with native support for Polynomial Functors.☆40Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- HoTT Book formalisations in Rzk.☆19Updated last year
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- A toy example of a verified compiler.☆30Updated 6 months ago
- A cost-aware logical framework, embedded in Agda.☆67Updated last week
- Experiments with SAT solvers with proofs in Lean 4☆62Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- Distributions of Agda executable compiled into WebAssembly.☆24Updated last week
- A Testing Framework for Lean☆64Updated 2 weeks ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆78Updated this week
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated this week
- Code samples for Lean 4☆78Updated 2 years ago
- A toolkit for enforcing logical specifications on neural networks☆117Updated this week
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Write C shims from within Lean code.☆76Updated 4 months ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- Effective Algebraic Topology in Haskell☆90Updated last year