Proving correctness and completeness of normal programs – a declarative approach (Q5715449): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s147106840500253x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2126250701 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:16, 30 July 2024
scientific article; zbMATH DE number 2242965
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving correctness and completeness of normal programs – a declarative approach |
scientific article; zbMATH DE number 2242965 |
Statements
Proving correctness and completeness of normal programs – a declarative approach (English)
0 references
3 January 2006
0 references
declarative programming
0 references
program correctness
0 references
completeness
0 references
