Abstract
Equational programming language (EP) is a novel intelligence language. This paper describes our EP system based on equational logic. Its execution mechanism is pattern matching. The paper focuses the discussion on the improvement to bottom-up tree pattern matching. The new bottom-up method shows high execution efficiency.
Similar content being viewed by others
References
Hoffman C, O'Donnell M. Programming with equations. ACM Trans on Programming Language and Systems, 1982: 83–112.
Chase D R. An improvement to bottom-up tree pattern matching. In: Conf. Record of ACM SIGACT/SIGPLAN Symp on POPL, 1987: 168–177.
Darlington J, Field A J, Pull H. The unification of functional and logic language. In: Logic Programming, Functions, Relations and Equations, 1986.
Goguen J A. EQLOG: Equality, types and generic modules for logic programming. In: Logic Programming, Functions, Relations and Equations, 1986.
O'Donnell M J. Equational logic as a programming language. Cambridge, Mass: MIT Press, 1985.
Author information
Authors and Affiliations
Additional information
This paper was supported by National Natural Science Foundation and High Technology Foundation.
Rights and permissions
About this article
Cite this article
Han, Q., Lu, R. & Sun, Y. An improved bottom-up method for implementing equational programming language. J. of Compt. Sci. & Technol. 9, 63–69 (1994). https://doi.org/10.1007/BF02939487
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02939487