GiraffeReversed / edulintLinks
EduLint is a Python linter aimed at helping novice programmers improve their coding style.
☆11Updated last week
Alternatives and similar repositories for edulint
Users that are interested in edulint are comparing it to the libraries listed below
Sorting:
- MathLib is a versatile C++ library that provides a wide range of mathematical algorithms and functions, including but not limited to tran…☆11Updated 2 years ago
- experiments in building tiny tracing JITs in various languages (Prolog to start)☆11Updated last month
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated last year
- Python term rewriting☆30Updated 12 years ago
- ☆19Updated 8 years ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Updated 5 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- The project SPARK Formal aims at developing a complete semantics of the SPARK language in Coq.☆12Updated 4 years ago
- Symbolic execution engine for toy language.☆51Updated 7 years ago
- Partial evaluation of Python code☆22Updated 2 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 5 years ago
- Featherweight C, Executable Semantics: Parser, Type Checker, and Abstract Machine☆29Updated 4 years ago
- Mechanized Theory of Event Structures☆16Updated 2 years ago
- Reference sheet for the Coq language.☆15Updated 5 years ago
- Datalog + Egg = Good☆66Updated 2 years ago
- The formal proof of the Odd Order Theorem☆37Updated 2 months ago
- A library for binary analysis and rewriting☆49Updated 2 years ago
- Metamath verifier in Python☆40Updated 7 months ago
- Cerberus C semantics☆80Updated 2 weeks ago
- TPTP linear logic version☆15Updated last year
- A synthesis-enabled solver for relational logic☆29Updated 7 years ago
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Updated 4 months ago
- A symbolic debugger for C/C++ (via LLVM), machine code, and JVM programs☆20Updated 5 years ago
- Pedagogical first-order prover in Python☆79Updated 7 months ago
- A (parametrized) Rust SAT solver originally based on MiniSat☆32Updated last year
- Resources for Learning PLT Redex☆13Updated 4 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Updated 3 weeks ago
- Challenging SAT benchmarks for matrix multiplication☆11Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year