Alternatives and similar repositories for nano-smt:

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

• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• maximedenes / coq-amd64
  ☆22Updated 8 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆33Updated 7 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 8 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• lastland / WebSpec
  ☆18Updated 7 years ago
• UlfNorell / x86-agda
  Inline, type safe X86-64 assembly programming in Agda
  ☆68Updated 6 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆32Updated 6 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆36Updated 13 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 10 years ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 4 months ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• iu-parfunc / haskell_dsl_tour
  Examples of relevant technologies for implementing DSLs in Haskell.
  ☆15Updated 9 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 6 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆21Updated 8 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆46Updated 5 years ago
• yav / simple-smt
  ☆21Updated 2 months ago