SMT
AssessTechniques
Satisfiability Modulo Theories, a generalization of SAT for richer constraints.
Why it's here
Placed in Assess: 4 article(s) of evidence from 1 source(s), led by research-stage coverage, with 0 in the last 30 days. Confidence 39%.
Evidence (4)
- 4Hacker News·8/13/2026researchPostmortem on NP-hard pessimism
The article argues that NP-hardness is often overstated in practice, because many real-world workloads never hit the worst case and can still be solved efficiently with good algorithms and heuristics. It cites examples such as package dependency resolution, type checking, scheduling, TSP, and SAT/SMT solving at scale to show that theory does not always predict practical performance.
- 5Hacker News·8/2/2026open_sourceF* proof-oriented programming language
F* is a general-purpose proof-oriented programming language that combines dependent types, SMT-based proof automation, and interactive theorem proving. It supports functional and effectful programming, compiles by default to OCaml, and can also target C, F#, Wasm, or assembly through related toolchains.
- 4Hacker News·7/30/2026product_launchLogic for Programmers Book Released
A new book titled "Logic for Programmers" presents practical logic concepts for working programmers, covering topics such as code refactoring, testing, formal verification, database theory, and logic programming. It is aimed at intermediate to advanced developers and is available in PDF, EPUB, and print formats, with code samples published on GitHub.
- 6Hacker News·7/26/2026researchLLMs May Automate Proofs in Dependently Typed Languages
The article argues that large language models, combined with proof irrelevance, could significantly reduce the manual effort required in dependently typed languages. It describes a Lean-based experiment building a Zstandard decompressor to test whether LLMs can make proof automation more practical and lessen proof engineering overhead.