mdaines / grammophoneLinks
A tool for analyzing and transforming context-free grammars.
☆221Updated last month
Alternatives and similar repositories for grammophone
Users that are interested in grammophone are comparing it to the libraries listed below
Sorting:
- JavaScript library for working with automata and grammars for regular and context-free languages☆216Updated 9 months ago
- Tree Proof Generator☆169Updated 3 months ago
- A JavaScript SAT solver (http://www.comp.nus.edu.sg/~gregory/sat/)☆48Updated 10 years ago
- Visualize Turing machines and deterministic finite automata. 🔵🔁🔴↩️☆264Updated 4 years ago
- BNF Converter☆602Updated 2 months ago
- A wiki for collaborative work on totally legitimate "category theory"☆112Updated 11 months ago
- Search for ambiguities in context-free grammars.☆40Updated 4 years ago
- metamath proof enumerators and other things☆93Updated 10 months ago
- Turing machine simulator in HTML/Javascript☆84Updated last year
- A terse declarative logic programming language☆118Updated 4 years ago
- git mirror of the Munich isabelle hg repository☆125Updated last month
- ☆40Updated 9 years ago
- The goal is to help studying logic and solvers by providing easy-to-use, pure browser-based javascript tools for both full classical pred…☆72Updated 4 years ago
- Implementation of the λΠ-calculus modulo rewriting☆209Updated last month
- Coq Support for Visual Studio Code☆92Updated 5 years ago
- An Open Encyclopedia of Proof Systems☆118Updated 2 years ago
- ☆142Updated this week
- Hanoi Omega-Automata Format☆15Updated 2 years ago
- Beginning of formal language theory☆23Updated 5 years ago
- Metamath program - source code for the Metamath executable☆82Updated 3 weeks ago
- A collection of tools for writing technical documents that mix Coq code and prose.☆263Updated 3 months ago
- A function definition package for Coq☆231Updated last month
- The Vampire Theorem Prover☆339Updated this week
- Contextual types meet mechanized metatheory!☆190Updated 2 weeks ago
- CMU Undergrad Course☆96Updated 2 years ago
- A formalization of geometry in Coq based on Tarski's axiom system☆196Updated 3 weeks ago
- Constraint Logic Programming over Finite Domains☆182Updated 5 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- Formal proof of the Four Color Theorem [maintainer=@ybertot]☆208Updated last month
- Tricks you wish the Coq manual told you [maintainer=@tchajed]☆522Updated last week