{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihx4nydgwjfxuecmboe7c4zgstlqj4z5lkzmt5hwzvyeocczd2yra",
    "uri": "at://did:plc:pi6woz4d47bkuws673w2il2r/app.bsky.feed.post/3mg4w32ubssu2"
  },
  "path": "/t/ann-new-release-of-sbv-v13-6/13756#post_1",
  "publishedAt": "2026-03-02T22:47:35.000Z",
  "site": "https://discourse.haskell.org",
  "tags": [
    "sbv: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving.",
    "tautology checker",
    "constant-folder/optimizer over a simple expressive language with let-bindings",
    "Kadane’s linear-time maximum-segment-sum algorithm"
  ],
  "textContent": "A new release of SBV (v3.16) is now on Hackage: sbv: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving.\n\nThis version improves support for the semi-automated theorem-proving interface, and adds several interesting examples from the theorem-proving folklore:\n\n  * Proof of a tautology checker\n  * Proof of the correctness of a constant-folder/optimizer over a simple expressive language with let-bindings.\n  * Proof of correctness for Kadane’s linear-time maximum-segment-sum algorithm\n\n\n\nHappy hacking!\n\n-Levent.",
  "title": "[ANN] New release of SBV (v13.6)"
}