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
- HoTT in Lean 3☆81Updated 5 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- Real number computation software☆127Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- ☆47Updated 2 years ago
- Schemes in Lean (v2)☆43Updated 5 years ago
- The formal proof of the Odd Order Theorem☆34Updated 2 weeks ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 weeks ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Web based opetopic editor☆35Updated 10 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last week
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An equational theorem prover based on Knuth-Bendix completion☆54Updated this week
- A formalization of M-types in Agda☆34Updated 5 years ago
- Convert Haskell source code to Coq source code.☆87Updated 2 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Materials for the course "theorem prover lab: applications in programming languages" at KIT, SS2021 edition☆51Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Reference type checker for the Lean theorem prover☆16Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago