UCSD-PL / nano-smtView external linksLinks
"Toy" SMT Solver for Educational Purposes
☆20Apr 17, 2013Updated 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.☆15Feb 9, 2016Updated 10 years ago
- Compiler for IMP programming language implemented in Haskell☆16Jun 16, 2020Updated 5 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Translation from FOL to LTL+Past and LTL, via separation of LTL+Past☆10May 22, 2024Updated last year
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Compositional type checking for a Hindley-Milner type system☆11Mar 28, 2017Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Deep evaluation of data structures without NFData☆10Jan 20, 2015Updated 11 years ago
- A human readable style for binary data.☆12Dec 4, 2019Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- Utilities I find useful while working on GHC (mirror of GitLab repo)☆24Feb 28, 2020Updated 5 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Jul 26, 2022Updated 3 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago
- Proof checker for propositional logic☆16Jul 7, 2017Updated 8 years ago
- SMTLib2 interface implementation for Haskell☆18Dec 6, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Jul 12, 2017Updated 8 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Jan 14, 2019Updated 7 years ago
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 8 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Haskell Type Level Example Programs☆28Nov 30, 2017Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- fast clustering algorithms☆15Feb 13, 2019Updated 7 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Racket bindings for Z3☆20Aug 7, 2012Updated 13 years ago
- ☆22Oct 20, 2025Updated 3 months ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Link to preprints for POPL'18 and colocated events☆86Jun 16, 2018Updated 7 years ago