kach / recreational-rosetteLinks
Some fun examples of solving problems with symbolic execution
☆115Updated 7 years ago
Alternatives and similar repositories for recreational-rosette
Users that are interested in recreational-rosette are comparing it to the libraries listed below
Sorting:
- Collapsing Towers of Interpreters☆91Updated 4 months ago
- Dependently-typed language with Iverson-style implicit lifting☆126Updated 5 years ago
- ☆59Updated 11 years ago
- The Pascal-F Verifier☆50Updated 8 years ago
- surgical precision JIT compilers☆122Updated 8 years ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆87Updated 2 years ago
- Book lucid interpreter written in python☆24Updated 6 years ago
- Datalog with support for SMT queries and first-order functional programming☆164Updated last week
- Meta-level run-time services for Unix processes... a.k.a. dragging Unix into the 1980s☆240Updated last week
- APL Compiler targeting a typed array intermediate language☆216Updated last year
- An in-memory datalog implementation for OCaml.☆272Updated last year
- Verified hash-based AMQ structures in Coq☆124Updated 5 years ago
- Synthesis of Heap-Manipulating Programs from Separation Logic☆128Updated 2 years ago
- Prolog implementation of microKanren☆43Updated 10 years ago
- DEPRECATED. Soufflé is a translator of declarative Datalog programs into the C++ language.☆49Updated 8 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- Constraint Logic Programming over Integers☆209Updated last year
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆136Updated 4 months ago
- Algorithmic Information Theory, using Binary Lambda Calculus☆171Updated this week
- A public repository to host Alloy models. This repository holds public models to be used as entertainment, examples, tutorials, utilitie…☆136Updated 4 months ago
- A small compiler for PCF☆127Updated 5 years ago
- This repository contains the Maude 2 interpreter source tree.☆43Updated 7 years ago
- Beautiful, interactive visualizations of logical inference☆149Updated 4 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆155Updated 3 weeks ago
- Continuation Passing C☆115Updated 6 years ago
- A PEG that compiles itself.☆75Updated 15 years ago
- [Mirror] A close reading of the μKanren paper.☆43Updated 3 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆103Updated last year
- Demo of Ken Thompson's Reflections on Trusting Trust as a tiny lisp compiler☆96Updated 10 years ago
- A simple implementation of the SECD abstract machine (https://en.wikipedia.org/wiki/SECD_machine)☆124Updated 12 years ago