Deduction and declarative programming / Peter Padawitz.
Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e...
Saved in:
| Online Access: |
Full Text (via Cambridge) |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge [England] ; New York :
Cambridge University Press,
1992.
|
| Series: | Cambridge tracts in theoretical computer science ;
28. |
| Subjects: |