Alternatives and similar repositories for imp

Users that are interested in imp are comparing it to the libraries listed below

• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago
• GaloisInc / cryptol-semantics
  Semantics for Cryptol
  ☆16Updated 7 years ago
• langston-barrett / coq-big-o
  A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
  ☆36Updated 8 years ago
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆36Updated 11 months ago
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• lastland / WebSpec
  ☆17Updated 8 years ago
• csabahruska / p4f-control-flow-analysis
  Haskell implementation of P4F Control-Flow Analysis
  ☆21Updated 3 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆46Updated last year
• svenkeidel / sturdy
  Sturdy is a library for developing sound static analyses in Haskell.
  ☆62Updated 2 years ago
• jonsterling / sml-logical-framework
  Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought
  ☆14Updated 8 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• ISANobody / sill
  ☆29Updated 10 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 8 months ago
• jwiegley / z3cat
  Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations
  ☆38Updated 8 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 8 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• yav / simple-smt
  ☆22Updated 3 months ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆16Updated 7 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 6 years ago
• andrejbauer / what-is-algebraic-about-algebraic-effects
  ☆48Updated 6 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• pigworker / shonky
  being some experiments, working towards some equipment I wish I had
  ☆37Updated 10 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 6 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 11 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆86Updated 7 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆31Updated 2 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago