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:
- System F in coq.☆19Updated 10 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- ☆29Updated 10 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆26Updated 8 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- The Prettiest Printer☆35Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Semantics for Cryptol☆16Updated 7 years ago