UCSD-PL / nano-smt
"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
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago
- ☆18Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- ☆29Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- The Prettiest Printer☆34Updated last year
- Supporting tool for Gradual Typing☆16Updated 4 years ago
- ☆26Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- 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
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- ☆22Updated 9 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- xmonad in Coq☆46Updated 12 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago