How to make ad hoc proof automation less ad hoc (Q5176973): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Coq / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Haskell / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: seL4 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Delphin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4214826241 / rank | |||
Normal rank | |||
Latest revision as of 22:59, 19 March 2024
scientific article; zbMATH DE number 6411542
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to make ad hoc proof automation less ad hoc |
scientific article; zbMATH DE number 6411542 |
Statements
How to make ad hoc proof automation less ad hoc (English)
0 references
5 March 2015
0 references
canonical structures
0 references
Coq
0 references
custom proof automation
0 references
Hoare type theory
0 references
interactive theorem proving
0 references
tactics
0 references
type classes
0 references
