Alternatives and similar repositories for nano-smt

Users that are interested in nano-smt are comparing it to the libraries listed below

• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 7 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 7 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• lastland / WebSpec
  ☆18Updated 8 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆33Updated 8 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 9 years ago
• jonsterling / agda-effectful-forcing
  Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…
  ☆12Updated 4 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆28Updated 3 weeks ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 6 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• TikhonJelvis / imp
  Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.
  ☆16Updated 9 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆34Updated last year
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year