UCSD-PL / nano-smtLinks
"Toy" SMT Solver for Educational Purposes
☆20Updated 12 years ago
Alternatives and similar repositories for nano-smt
Users that are interested in nano-smt are comparing it to the libraries listed below
Sorting:
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago
- System F in coq.☆19Updated 10 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Constructive Galois connections☆32Updated 7 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- ☆18Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- ☆21Updated 6 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- xmonad in Coq☆46Updated 13 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- ☆29Updated 9 years ago
- ☆26Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago