Alternatives and similar repositories for deduce

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

• engboris / stellogen
  An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
  ☆107Updated this week
• tnelson / Forge
  Forge: A Tool and Language for Teaching Formal Methods
  ☆81Updated last week
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆174Updated 4 years ago
• liamoc / holbert
  A graphical interactive proof assistant designed for education
  ☆166Updated 7 months ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆53Updated 5 months ago
• blanchette / logical_verification_2023
  Hitchhiker's Guide to Logical Verification (2023 Edition)
  ☆110Updated last year
• kmill / lean4-raytracer
  A simple raytracer written in Lean 4
  ☆139Updated last year
• cu1ch3n / type-inference-zoo
  🦖 Implementations of various type inference algorithms. Online interactive playground is available at https://zoo.cuichen.cc/
  ☆141Updated 3 weeks ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 4 months ago
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆164Updated last month
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆73Updated 2 years ago
• CertiCoq / certicoq
  A Verified Compiler for Gallina, Written in Gallina
  ☆153Updated last week
• leanprover-community / con-nf
  A formal consistency proof of Quine's set theory New Foundations
  ☆72Updated 3 weeks ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆177Updated 2 months ago
• CMU-HoTT / scott
  Selected Papers of Dana S. Scott
  ☆162Updated last year
• cognitive-engineering-lab / document-calculus
  Accompanying materials for "A Core Calculus for Documents"
  ☆33Updated last year
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆73Updated 8 years ago
• shwestrick / smlfmt
  A custom parser/auto-formatter for Standard ML
  ☆78Updated 2 months ago
• jespercockx / agda-lecture-notes
  Agda lecture notes for the Functional Programming course at TU Delft
  ☆127Updated last year
• lexa-lang / lexa
  ☆34Updated 9 months ago
• zydeco-lang / zydeco
  a proof-of-concept programming language based on call-by-push-value
  ☆54Updated this week
• medovina / natty
  Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…
  ☆36Updated last week
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated last month
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆74Updated 4 months ago
• blanchette / interactive_theorem_proving_2024
  Files associated with the course Interactive Theorem Proving at LMU SoSe 2024
  ☆62Updated 11 months ago
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆72Updated this week
• leanprover / fp-lean
  Functional Programming in Lean
  ☆99Updated last week
• rocq-community / semantics
  A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…
  ☆51Updated 3 years ago
• maude-lang / Maude
  Language based on Rewriting Logic
  ☆126Updated 2 weeks ago
• caotic123 / PomPom-Language
  The cuteness implementation of a dependently typed language.
  ☆191Updated 2 years ago