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
• lastland / WebSpec
  ☆18Updated 7 years ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 7 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆34Updated last year
• 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
• iu-parfunc / haskell_dsl_tour
  Examples of relevant technologies for implementing DSLs in Haskell.
  ☆15Updated 9 years ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 13 years ago
• LightAndLight / lambdapi
  Educational implementation of dependent types
  ☆19Updated 6 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• xnning / dependent-types-in-haskell
  Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup
  ☆15Updated 6 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 4 months ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• ilyasergey / monadic-cfa
  Generic implementation of different CFA families based on monadic decomposition
  ☆21Updated 12 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago