psg-mit / smoothLinks
An arbitrary-precision differentiable programming language.
☆36Updated 2 years ago
Alternatives and similar repositories for smooth
Users that are interested in smooth are comparing it to the libraries listed below
Sorting:
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- Real number computation software☆129Updated 3 years ago
- Datatypes as quotients of polynomial functors☆39Updated 5 years ago
- ☆49Updated 2 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 2 weeks ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Paper and talk☆55Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Advent of Code 2020 solutions in Lean 4☆27Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆40Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- Reference type checker for the Lean theorem prover☆17Updated 7 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Two-Level Type Theory☆28Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Agda category theory library for denotational design☆56Updated this week
- Schemes in Lean (v2)☆43Updated 5 years ago
- Materials for the course "theorem prover lab: applications in programming languages" at KIT, SS2021 edition☆51Updated 4 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆73Updated last year
- Implementation of higher-order logic in Python☆65Updated 2 years ago