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:
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Datatypes as quotients of polynomial functors☆41Updated 5 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Python bindings for the Coq interactive proof assistant☆57Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- ☆38Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- ☆50Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆42Updated 2 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 5 months ago
- Paper and talk☆55Updated 2 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- Graded Dependent Type systems☆25Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Papers on aspects of Generalised Algebraic Theories, Contextual Categories and Mathematical Theory Of Data☆41Updated this week