| dc.contributor.author | Burrows, Eva | eng |
| dc.date.accessioned | 2011-05-16T08:59:10Z | |
| dc.date.available | 2011-05-16T08:59:10Z | |
| dc.date.issued | 2003 | eng |
| dc.identifier.uri | https://hdl.handle.net/1956/4772 | |
| dc.description | Author name on thesis: Eva Suci | en_US |
| dc.description.abstract | Alma-0 is a programming language supporting declarative programming, which combines the advantages of imperative and logic programming paradigms. This work explores declarative programming by extending the interpretation of Alma-0 programs to recursive and/or non-recursive procedures which exclude destructive assignments, and gives formal proofs for the implication: Implementation --> Specification for some non-trivial examples, e.g., finding a maximum element and various sorting algorithms. | en_US |
| dc.language.iso | eng | eng |
| dc.title | Formulas as programs | en_US |
| dc.type | Master thesis | |
| dc.rights.holder | The author | en_US |
| dc.rights.holder | Copyright the author. All rights reserved | en_US |
| dc.subject.nsi | VDP::Technology: 500::Information and communication technology: 550::Computer technology: 551 | en_US |
