Alternatives and similar repositories for cryptol-semantics

Users that are interested in cryptol-semantics are comparing it to the libraries listed below

• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• eugmes / imp
  Compiler for IMP programming language implemented in Haskell
  ☆16Updated 5 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 8 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 11 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 11 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
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆21Updated 3 years ago
• yveszhang / ldtyping
  ☆12Updated 9 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• derekelkins / ads
  Authenticated Data Structures
  ☆16Updated 10 years ago
• pigworker / WhatRTypes4
  being the materials from my YOW LambdaJam 2016 talk
  ☆11Updated 9 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 8 years ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• yav / simple-smt
  ☆22Updated 3 months ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated last year
• i-am-tom / dagless
  A monadic interface for DAG construction.
  ☆24Updated 4 years ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 6 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 8 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆38Updated 14 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 8 years ago
• gergoerdi / universe-of-syntax
  A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…
  ☆16Updated 8 years ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆22Updated 7 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 7 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 6 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 7 years ago