Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Equational logic as a programming language
Equational logic as a programming language
Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
Logic programming: functions, relations, and equations
Logic programming: functions, relations, and equations
The relation between logic and functional languages: A survey
Journal of Logic Programming
Functional programing and the logical variable
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Equations, sets, and reduction semantics for functional and logic programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Equational logic programming: an extension to equational programming
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
TABLOG: The deductive-tableau programming language
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Parallel interpretation of logic programs
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Prolog - the language and its implementation compared with Lisp
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
LISP 1.5 Programmer's Manual
EQL: The Language and its Implementation
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
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.