Abstract
We present the formal semantics of a novel language, called EqL, for first-order functional and Horn logic programming. An EqL program is a set of conditional pattern-directed rules, where the conditions are expressed as a conjunction of equations. The programming paradigm provided by this language may be called equational programming. The declarative semantics of equations is given in terms of their complete set of solutions, and the operational semantics for solving equations is an extension of reduction, 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.
| Original language | English |
|---|---|
| Pages (from-to) | 472-480 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Software Engineering |
| Volume | 14 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 1988 |
Keywords
- Correctness theorems
- denotational semantics
- equation solving
- equational programming
- functional programming
- logic programming
- object refinement
- reduction semantics
Fingerprint
Dive into the research topics of 'Semantics of EqL'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver