psg-mit / smooth
An arbitrary-precision differentiable programming language.
☆34Updated last year
Alternatives and similar repositories for smooth:
Users that are interested in smooth are comparing it to the libraries listed below
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Hoare Type Theory☆71Updated last month
- An encyclopedia of proofs☆57Updated 3 months ago
- HoTT in Lean 3☆78Updated 4 years ago
- Papers on aspects of Generalised Algebraic Theories, Contextual Categories and Mathematical Theory Of Data☆39Updated this week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆50Updated 5 months ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated 4 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- An extended typed Lambda Calculus☆21Updated 6 months ago
- Coq library for serialization to S-expressions☆18Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Haskell implementation of nominal datatypes and functions☆39Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- ☆36Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Reference type checker for the Lean theorem prover☆61Updated 7 years ago
- An equational theorem prover based on Knuth-Bendix completion☆50Updated this week
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020☆19Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 8 months ago