Issue No. 04 - April (1988 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.4670
<p> 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.</p>
Correctness theorems, denotational semantics, equational programming, equation solving, functional programming, logic programming, object refinement, reduction semantics.
B. Jayaraman, "Semantics of EqL," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 472-480, 1988.