UCSD-PL / nano-smt
"Toy" SMT Solver for Educational Purposes
☆20Updated 11 years ago
Related projects ⓘ
Alternatives and complementary repositories for nano-smt
- System F in coq.☆19Updated 9 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- ☆18Updated 7 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- ☆22Updated 8 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- ☆29Updated 9 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 10 months ago
- The Prettiest Printer☆35Updated 8 months ago
- A discouraging story.☆15Updated 6 years ago
- ☆25Updated 7 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆17Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 weeks ago
- Compositional type checking for Haskell☆36Updated 13 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
- A tool for translating imperative programs to CSP.☆10Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 8 years ago
- Semantics for Cryptol☆16Updated 6 years ago
- ☆11Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 5 years ago