rocq-community / qarith-stern-brocotLinks
Binary rational numbers in Coq [maintainer=@herbelin]
☆15Updated last year
Alternatives and similar repositories for qarith-stern-brocot
Users that are interested in qarith-stern-brocot are comparing it to the libraries listed below
Sorting:
- Algorithmic Information Theory, using Binary Lambda Calculus☆172Updated last week
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last month
- mmj2 GUI Proof Assistant for the Metamath project☆75Updated last year
- Animations of lambda term reduction sequences☆152Updated 7 years ago
- metamath proof enumerators and other things☆91Updated this week
- Deposited packages of the homalg project☆16Updated last month
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- [Mirror] A close reading of the μKanren paper.☆43Updated 3 years ago
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆16Updated 7 years ago
- A place to put our 2018 Xena project UROP thoughts and programs.☆25Updated 5 years ago
- Source of metamath book☆51Updated last year
- Interactive Scheme Primer, written in Scheme.☆22Updated 4 months ago
- Here we give programs that check if Turing machines halt or not.☆14Updated 2 months ago
- Mystery Languages☆41Updated 2 years ago
- Untyped Concatenative Calculus☆19Updated 3 years ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 4 months ago
- ☆56Updated 6 months ago
- Haskell User's Gofer System☆27Updated 9 years ago
- Learn Lean and topology☆24Updated 2 years ago
- Lean 4 Metamath verifier☆21Updated 5 months ago
- Statements of famous theorems proven in Coq [maintainer=@jmadiot]☆60Updated 4 months ago
- Metamath program - source code for the Metamath executable☆88Updated 3 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆81Updated 8 years ago
- Code samples for Lean 4☆77Updated 2 years ago
- Dependently-typed language with Iverson-style implicit lifting☆126Updated 5 years ago
- Choiceless grapher: a common-lisp diagram maker for consequences of the Axiom of Choice. This is a mirror of https://gitlab.common-lisp.n…☆29Updated 5 months ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆60Updated 5 months ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆35Updated 5 months ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago