Showing 8 of 8 projects
A curated list of resources for theoretical computer science, emphasizing mathematical techniques and rigor.
A curated list of resources for learning theoretical computer science, emphasizing mathematical techniques and rigor.
A lightweight proof assistant for teaching and exploring formal verification, accompanying The Little Prover book.
A conceptual, declarative query language for TypeDB that enables polymorphic queries and intuitive data modeling.
A Coq library containing mechanized reductions to establish undecidability results for problems in logic and computation.
A Coq-based project exploring hydra battles, ordinal numbers, addition chains, and Gödel's incompleteness theorem through formalized mathematics.
A Coq library providing enhanced coinductive proof methods based on the 'companion' concept from coinduction theory.
A tiny Elixir library for defining simple rule handlers using pattern matching.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.