Accession Number:

ADA188151

Title:

Semantics of EqL,

Descriptive Note:

Corporate Author:

NORTH CAROLINA UNIV AT CHAPEL HILL DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Jayaraman, Bharat

Report Date:

1987-01-01

Pagination or Media Count:

19.0

Abstract:

This document presents 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.

Descriptors:

• *SEMANTICS
• *MATHEMATICAL PROGRAMMING
• EQUATIONS
• PROBLEM SOLVING

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE