Alternatives and similar repositories for cryptol-semantics:

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

• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 2 months ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 7 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 10 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆25Updated 7 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• eugmes / imp
  Compiler for IMP programming language implemented in Haskell
  ☆16Updated 4 years ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆20Updated 10 months ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 5 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• jyp / sctt
  Type-Theory in Sequent Calculus
  ☆13Updated 9 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• yav / simple-smt
  ☆21Updated 2 months ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 4 months ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• lthms / chain
  Extensible, Type Safe Error Handling in Haskell
  ☆13Updated 4 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• shlevy / cat-fiat
  An attempt to formalize unix cat in fiat
  ☆12Updated 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 7 years ago