UCSD-PL / nano-smt
"Toy" SMT Solver for Educational Purposes
☆20Updated 11 years ago
Alternatives and similar repositories for nano-smt:
Users that are interested in nano-smt are comparing it to the libraries listed below
- System F in coq.☆19Updated 10 years ago
- ☆29Updated 9 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Examples of relevant technologies for implementing DSLs in Haskell.☆15Updated 9 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- ☆21Updated 3 months ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago
- ☆22Updated 9 years ago
- ☆18Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Compositional type checking for Haskell☆37Updated 13 years ago
- The Prettiest Printer☆35Updated last year
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- ☆17Updated 2 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago