Alternatives and similar repositories for regraph:

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

• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• brownplt / Resugarer
  Lifting Reduction Semantics through Syntactic Sugar
  ☆13Updated 6 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆51Updated last week
• plclub / cbpv-effects-coeffects
  Formalization of CBPV extended with effect and coeffect tracking
  ☆12Updated 4 months ago
• JoeyEremondi / GDTL-artifact
  A Gradual Dependently-typed Language
  ☆14Updated 5 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆24Updated last year
• JonasHoefer / scoped-effects-agda
  An implementation of scoped algebraic effects and handlers in Agda.
  ☆12Updated 3 years ago
• wilbowma / experimenting-with-redex
  A Redex tutorial with a focus on how to do work in Redex
  ☆11Updated 2 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆27Updated 3 years ago
• HarrisonGrodin / agda-modtt
  ModTT in Agda
  ☆11Updated 3 years ago
• SchrodingerZhu / LeanGccBackend
  Lean4 backend using `libgccjit`!
  ☆11Updated last year
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated 10 months ago
• elpinal / subtyping-agda
  Some rudimentary proofs on subtyping
  ☆11Updated 2 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆19Updated 3 months ago
• AliasQli / tactics
  ☆16Updated 2 years ago
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆19Updated last year
• verse-lab / lean-ssr
  LeanSSR: an SSReflect-Like Tactic Language for Lean
  ☆32Updated 4 months ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 5 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 2 years ago
• sergei-romanenko / spsc
  SPSC: A Small Positive Supercompiler
  ☆32Updated 8 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…
  ☆19Updated 3 years ago
• jmlowenthal / agda-c
  Verified C programming in Agda
  ☆16Updated 3 years ago
• AD1024 / dtlc
  Dependently typed lambda calculus - A Simple Proof Assistant
  ☆12Updated 4 years ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆49Updated last month
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆34Updated last year
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆17Updated last month
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆21Updated 2 years ago
• Guest0x0 / trebor
  an implementation of Observational Type Theory (OTT) and more
  ☆26Updated 2 years ago