-
Notifications
You must be signed in to change notification settings - Fork 167
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #2873 from palmskog/add-stalmarck-8.19
add coq-stalmarck.8.19.0 and coq-stalmarck-tactic.8.19.0
- Loading branch information
Showing
2 changed files
with
71 additions
and
0 deletions.
There are no files selected for viewing
36 changes: 36 additions & 0 deletions
36
extra-dev/packages/coq-stalmarck-tactic/coq-stalmarck-tactic.8.19.0/opam
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,36 @@ | ||
| opam-version: "2.0" | ||
| maintainer: "[email protected]" | ||
|
|
||
| homepage: "https://github.com/coq-community/stalmarck" | ||
| dev-repo: "git+https://github.com/coq-community/stalmarck.git" | ||
| bug-reports: "https://github.com/coq-community/stalmarck/issues" | ||
| license: "LGPL-2.1-or-later" | ||
|
|
||
| synopsis: "Coq tactic and verified tool for proving tautologies using Stålmarck's algorithm" | ||
|
|
||
| build: ["dune" "build" "-p" name "-j" jobs] | ||
| depends: [ | ||
| "ocaml" {>= "4.09.0"} | ||
| "dune" {>= "2.8"} | ||
| "coq" {>= "8.19" & < "8.20"} | ||
| "coq-stalmarck" {= version} | ||
| ] | ||
|
|
||
| tags: [ | ||
| "category:Miscellaneous/Coq Extensions" | ||
| "category:Miscellaneous/Extracted Programs/Decision procedures" | ||
| "keyword:boolean formula" | ||
| "keyword:tautology checker" | ||
| "keyword:tactics" | ||
| "logpath:Stalmarck.Tactic" | ||
| "date:2023-12-23" | ||
| ] | ||
| authors: [ | ||
| "Pierre Letouzey" | ||
| "Laurent Théry" | ||
| ] | ||
|
|
||
| url { | ||
| src: "https://github.com/coq-community/stalmarck/releases/download/v8.19.0/stalmarck-8.19.0.tar.gz" | ||
| checksum: "sha512=b7b408366a326a699aaa10e61793cee76238830f9356015ba1fe263727003a5c6237d3471f1d5a3ee3aeeb791b0ad5a531ec78ee93febd1e9d2100f509ff9641" | ||
| } |
35 changes: 35 additions & 0 deletions
35
extra-dev/packages/coq-stalmarck/coq-stalmarck.8.19.0/opam
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,35 @@ | ||
| opam-version: "2.0" | ||
| maintainer: "[email protected]" | ||
|
|
||
| homepage: "https://github.com/coq-community/stalmarck" | ||
| dev-repo: "git+https://github.com/coq-community/stalmarck.git" | ||
| bug-reports: "https://github.com/coq-community/stalmarck/issues" | ||
| license: "LGPL-2.1-or-later" | ||
|
|
||
| synopsis: "Verified implementation of Stålmarck's algorithm for proving tautologies in Coq" | ||
| description: """ | ||
| A two-level approach to prove tautologies using Stålmarck's | ||
| algorithm in Coq.""" | ||
|
|
||
| build: [make "-j%{jobs}%"] | ||
| install: [make "install"] | ||
| depends: [ | ||
| "coq" {>= "8.19" & < "8.20"} | ||
| ] | ||
|
|
||
| tags: [ | ||
| "category:Computer Science/Decision Procedures and Certified Algorithms/Decision procedures" | ||
| "keyword:boolean formula" | ||
| "keyword:tautology checker" | ||
| "logpath:Stalmarck.Algorithm" | ||
| "date:2023-12-23" | ||
| ] | ||
| authors: [ | ||
| "Pierre Letouzey" | ||
| "Laurent Théry" | ||
| ] | ||
|
|
||
| url { | ||
| src: "https://github.com/coq-community/stalmarck/releases/download/v8.19.0/stalmarck-8.19.0.tar.gz" | ||
| checksum: "sha512=b7b408366a326a699aaa10e61793cee76238830f9356015ba1fe263727003a5c6237d3471f1d5a3ee3aeeb791b0ad5a531ec78ee93febd1e9d2100f509ff9641" | ||
| } |