Abstract
A language called EqL is presented for first-order functional and Horn logic programming. An EqL program is a set of conditional rewrite rules, where the conditions are expressed as a conjunction of equations. The programming paradigm provided by this language is called equational programming. The formal semantics of equations is given in terms of complete sets of solutions and the operational semantics is given in terms of a new technique called object refinement. The correctness of the operational semantics is established through soundness and completeness theorems. Examples are given to illustrate the language and its semantics. Computation in this language involves equation solution. Some preliminary ideas on the parallel execution of EqL using a tree of frames is also presented.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 47-57 |
| Number of pages | 11 |
| ISBN (Print) | 0818607416 |
| State | Published - 1986 |
Fingerprint
Dive into the research topics of 'EQUATIONAL PROGRAMMING: A UNIFYING APPROACH TO FUNCTIONAL AND LOGIC PROGRAMMING.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver