Semantics of EqL,

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1987
Accession Number
ADA188151

Entities

People

  • Bharat Jayaraman

Organizations

  • University of North Carolina at Chapel Hill

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Computer Languages
  • Computer Programming
  • Computer Science
  • Computers
  • Decomposition
  • Environment
  • Equations
  • Identities
  • Index Terms
  • Language
  • North Carolina
  • Notation
  • Programming Languages
  • Semantics
  • Software Development
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Computational Linguistics