fandreuz / BisPyLinks
BisPy - Python bisimulation library
☆16Updated 4 years ago
Alternatives and similar repositories for BisPy
Users that are interested in BisPy are comparing it to the libraries listed below
Sorting:
- LLVM support for the lean theorem prover☆53Updated 4 years ago
- sorear's Metamath system engine - version 3 Rust☆25Updated 2 years ago
- A Rust/WASM implementation of homotopy.io☆111Updated this week
- A formal consistency proof of Quine's set theory New Foundations☆79Updated 7 months ago
- Armv8 Native Code Symbolic Simulator in Lean☆96Updated 2 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated last year
- An automated theorem prover that uses Büchi automata.☆44Updated 4 years ago
- A Rust hashconsing library.☆38Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆73Updated this week
- A toy dependent typed language.☆36Updated this week
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆18Updated 5 months ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆41Updated 2 months ago
- Formalising the WASM spec in Lean☆27Updated 2 months ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- A toolkit for higher-dimensional diagram rewriting.☆18Updated 3 years ago
- Formalization of type theory☆22Updated 4 years ago
- Very controlled natural language tactics for Lean☆66Updated 2 years ago
- ☆38Updated 2 weeks ago
- Rust Automated Theorem Proving library inspired by a text by John Harrison (WIP)☆21Updated 8 months ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆57Updated this week
- Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.☆18Updated 5 years ago
- An arbitrary-precision differentiable programming language.☆36Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆42Updated 8 months ago
- A web-based graphical proof assistant for LK and Hoare logic.☆41Updated 3 weeks ago
- A monadic library for symbolic evaluation☆73Updated 6 months ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆46Updated 10 months ago