DocumentCode :
984336
Title :
Semantics of EqL
Author :
Jayaraman, Bharat
Author_Institution :
Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
Volume :
14
Issue :
4
fYear :
1988
fDate :
4/1/1988 12:00:00 AM
Firstpage :
472
Lastpage :
480
Abstract :
The formal semantics of a novel language, called EqL, are presented 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 the soundness and completeness theorems. Examples are given to illustrate the language and its semantics.
Keywords :
formal languages; formal logic; high level languages; logic programming; EqL; Horn logic; conditional pattern-directed rules; declarative semantics; equational programming; formal semantics; functional logic; logic programming; object refinement; programming paradigm; Acoustical engineering; Application software; Computer science; Equations; Functional programming; Logic programming; Modems; Programming profession;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/32.4670
Filename :
4670
Link To Document :
بازگشت