Whiley / WhileyTheoremProver
The Whiley Theorem Prover (WyTP) is an automatic and interactive theorem prover designed to discharge verification conditions generated by the Whiley Compiler. WyTP operates over a variant of first-order logic which includes integer arithmetic, arrays and quantification.
☆8Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for WhileyTheoremProver
- Poplog☆21Updated 14 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 11 years ago
- ☆19Updated 7 years ago
- purple: compiling a reflective language☆29Updated last month
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- Optimizing Abstract Abstract Machines☆30Updated 7 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- software archaeology of reflective towers of interpreters☆15Updated last month
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆32Updated 12 years ago
- The Aldor Programming Language☆33Updated 4 months ago
- An experimental typed version of the Rosette language☆13Updated 6 years ago
- An abstract machine for analyzing Racket bytecode.☆28Updated 3 years ago
- SML Parser Combinator Library☆27Updated 8 years ago
- Reason about Term Rewriting Systems☆15Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆10Updated 7 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆32Updated 6 months ago
- This repository contains the Maude 2 interpreter source tree.☆43Updated 6 years ago
- αProlog☆17Updated last year
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆24Updated 10 years ago
- ☆12Updated 2 weeks ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- JVM Abstracting Abstract Machine☆25Updated 5 years ago
- The PGG Partial Evaluation System for Scheme 48☆17Updated 11 years ago
- A Declarative Theorem Prover for First-Order Classical Logic☆28Updated 5 months ago
- An implementation of Oz on top of Truffle and Graal☆41Updated 2 years ago
- Lollimon, a monadic concurrent linear logic programming language☆28Updated 13 years ago
- Standard ML compiler based on typed intermediate languages.☆46Updated 10 years ago
- ☆21Updated 11 years ago
- Prolog implementation of microKanren☆41Updated 9 years ago