Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming (Q2640347)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4187115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming |
scientific article; zbMATH DE number 4187115 |
Statements
Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming (English)
0 references
1988
0 references
The authors define attribute grammars and show that they can be used to give an operational semantics to recursive program schemes. They define a notion of partial correctness of an attribute grammar with respect to a specification and give an inductive method for proving partial correctness. They show how this can be applied to prove correctness of imperative, applicative or logic programs. The paper is clear and includes numerous examples.
0 references
attribute grammars
0 references
correctness
0 references
0 references
0.7924426794052124
0 references
