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
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 11 years ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 6 years ago
• pigworker / WhatRTypes4
  being the materials from my YOW LambdaJam 2016 talk
  ☆11Updated 9 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆21Updated 3 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 8 years ago
• eugmes / imp
  Compiler for IMP programming language implemented in Haskell
  ☆16Updated 5 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• dorchard / effectful-explanations-talk
  "Programs that explain their effects" talk material
  ☆17Updated 7 years ago
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 5 years ago
• lthms / chain
  Extensible, Type Safe Error Handling in Haskell
  ☆13Updated 5 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 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
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• msullivan / typecoin
  Typecoin: Massively Multiplayer Online Linear Logic
  ☆18Updated 8 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago
• yav / simple-smt
  ☆22Updated 2 months ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 8 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• danelahman / Directed-Containers
  An Agda formalisation of the theory of directed containers
  ☆12Updated 8 months ago
• cocreature / zkboo-hs
  Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.
  ☆18Updated 7 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 11 months ago
• derekelkins / ads
  Authenticated Data Structures
  ☆16Updated 10 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 7 years ago