Functional programing and the logical variable
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Constraining-unification and the programming language unicorn
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Implementation of an interpreter for abstract equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Pattern driven lazy reduction: A unifying evaluation mechanism for functional and logic programs
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
APL '79 Proceedings of the international conference on APL: part 1
First-order unification in equational theories and its application to logic programming
First-order unification in equational theories and its application to logic programming
IEEE Transactions on Software Engineering
Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
Journal of Symbolic Computation
EQL: The Language and its Implementation
IEEE Transactions on Software Engineering
Equations, sets, and reduction semantics for functional and logic programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
| Hi-index | 0.00 |
The paradigm of equational programming potentially possesses all the features provided by Prolog-like languages. In addition, the ability to reason about equations, which is not provided by Prolog, can be accommodated by equational languages. In this paper, we propose an extended equational programming paradigm, and describe an equational logic programming language which is an extension of the equational language defined in [Hoff82]. Semantic foundations for the extension are discussed. The extended language is a powerful logic programming language in the sense of Prolog and thus enjoys the programming features that Prolog possesses. Furthermore, it provides an ability to solve equations, which captures the essential power of equational programming.