Alternatives and similar repositories for dafny-sandbox:

Users that are interested in dafny-sandbox are comparing it to the libraries listed below

• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• nachivpn / k
  Meta-theory and normalization for Fitch-style modal lambda calculi
  ☆18Updated 9 months ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• gdijkstra / hs-to-gallina
  Experimentation project
  ☆16Updated 11 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 3 months ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆20Updated 11 months ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 3 years ago
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• DavePearce / FeatherweightRust
  Provides a reference implementation of FeatherweightRust in Java.
  ☆14Updated 3 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 4 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• jkoppel / thermometer-continuations
  Examples from our paper "Capturing the Future by Replaying the Past"
  ☆21Updated 6 months ago
• Blaisorblade / dot-iris
  Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
  ☆31Updated last month
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆21Updated 2 years ago
• pi8027 / stablesort
  Stable sort algorithms and their stability proofs in Coq
  ☆22Updated 3 weeks ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• epfl-lara / SystemFR
  System FR: Formalized Foundations for Stainless
  ☆9Updated 3 years ago