Alternatives and similar repositories for cubicle

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

• vzaliva / helix
  Formally verified operator language and rewriting engine for high-performance computing
  ☆30Updated last year
• GaloisInc / lustre
  A parser and AST for Lustre
  ☆12Updated last year
• jamesbornholt / ocelot
  A synthesis-enabled solver for relational logic
  ☆29Updated 7 years ago
• akr / codegen
  Coq plugin for monomorphization and C code generation
  ☆35Updated this week
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆65Updated last week
• prg-titech / baccaml
  Experimental implementation of a meta-hybrid JIT compiler mixing trace- and method-based compilation strategies.
  ☆33Updated 7 months ago
• logic-tools / sml-handbook
  SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
  ☆36Updated 8 years ago
• Deducteam / Logipedia
  An encyclopedia of proofs
  ☆64Updated last year
• GeorgOfenbeck / SpaceTime
  This github repository hosts the code used within my thesis work and my last publication.
  ☆12Updated 8 years ago
• LPCIC / matita
  Matita (proof assistant) with embedded elpi
  ☆14Updated 7 years ago
• c-cube / mc2
  [research] A modular SMT solver in OCaml, based on mcSAT
  ☆39Updated last year
• sunshowers / z3.rkt
  Racket bindings for Z3
  ☆20Updated 13 years ago
• mit-plv / bedrock
  Coq library for verified low-level programming
  ☆61Updated 8 years ago
• JUrban / MPTP2
  ☆19Updated 8 years ago
• Kha / do-supplement
  Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"
  ☆14Updated 10 months ago
• sigurdschneider / lvc
  LVC verified compiler
  ☆60Updated 7 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• CakeML / candle
  The Candle theorem prover (fork of the HOL Light sources)
  ☆16Updated last year
• uwplse / potpie
  Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct
  ☆16Updated last year
• mit-plv / reification-by-parametricity
  Fast Setup for Proof by Reflection, in Two Lines of Ltac.
  ☆14Updated 4 years ago
• lamdu / lamdu-calculus
  An extended typed Lambda Calculus
  ☆21Updated last year
• Feldspar / feldspar-language
  The goal of the Feldspar project is to define a high-level language that allows description of high-performance digital signal processing…
  ☆47Updated 4 years ago
• AdaCore / sparkformal
  The project SPARK Formal aims at developing a complete semantics of the SPARK language in Coq.
  ☆12Updated 4 years ago
• wimmers / munta
  Fully verified model checker for realtime systems
  ☆17Updated 3 years ago
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 6 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 6 years ago
• Barry-Jay / Intensional-computation
  translations of a lambda abstraction to combinations of operators
  ☆18Updated 6 years ago
• nikivazou / proof-combinators
  Proof combinators used in Liquid Haskell for theorem proving
  ☆12Updated 7 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• lameiro / simple-tracing-jit
  A simple interpreter featuring a tracing JIT
  ☆16Updated 14 years ago