andrejbauer / marshall
Real number computation software
☆123Updated 2 years ago
Alternatives and similar repositories for marshall:
Users that are interested in marshall are comparing it to the libraries listed below
- HoTT in Lean 3☆77Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Reference type checker for the Lean theorem prover☆61Updated 7 years ago
- ☆84Updated 7 years ago
- Implementation of Univalence in Cubical Sets☆144Updated 9 years ago
- Web based opetopic editor☆35Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆112Updated this week
- Specification of the Cedille Core language☆29Updated 4 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated 3 months ago
- An experimental category theory library for Lean☆49Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆82Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆17Updated 11 months ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆55Updated 9 months ago
- Ground Zero: Lean 4 HoTT Library☆50Updated last month
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- ☆29Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆91Updated 2 weeks ago
- ☆45Updated last year
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago