This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. S. Conery and D. F. Kibler, “Parallel Interpretation of Logic Programs,” In Conf. Functional Prog. Lang. and Comp. Arch., ACM, 1981, pp. 163–170.
J. S. Conery and D. F. Kibler, “AND Parallelism and Nondeterminism in Logic Programs,” New Generation Computing, vol. 3, 1985, pp. 43–70.
W. F. Clocksin and C. S. Mellish, Programming in Prolog, Springer-Verlag, New York, 1981.
K. Clark and S. Gregory, “PARLOG: Parallel Programming in Logic,” TOPLAS, vol. 8, no. 1, pp. 1–49.
J. Darlington, “Unifying Functional and Logic Languages,” Internal Report, Imperial College, London, 1983.
N. Dershowitz and D. A. Plaisted, “Applicative Programming cum Logic Programming,” In 1985 Symp. on Logic Programming, Boston, pp. 54–66.
L. Fribourg, “Oriented Equational Clauses as a Programming Language,” J. Logic Prog. 2 (1984) pp. 165–177.
J. A. Goguen and J. Meseguer, “Equality, Types, Modules, and (Why Not?) Generics for Logic Programming,” J. Logic Prog. 2 (1984) pp. 179–210.
J-M. Hullot, “Canonical Forms and Unification,” In Proc. 5th Workshop on Automated Deduction, Springer Lecture Notes, 1980, pp. 318–334.
S. Haridi and A. Ciepielewski, “An OR-Parallel Token Machine,” Tech. Report No. TRITA-CS-8303, Royal Inst. of Tech., May 1983.
B. Jayaraman, “An Equational Language and its Evaluator,” TR-CS-84-11, Department of Computer Science, Univ. of N. Carolina, December 1984.
B. Jayaraman and F.S.K. Silbermann, “Equations, Sets, and Reduction Semantics for Functional and Logic Programming,” In 1986 ACM Conf. on LISP and Functional Programming, pp. 320–331, Boston, August 1986.
B. Jayaraman, F.S.K. Silbermann, G. Gupta, “Equational Programming: A Unifying Approach to Functional and Logic Programming,” In Int'l Conf. on Computer Languages, pp. 47–57, Miami Beach, October 1986.
G. Lindstrom, “OR-Parallelism on Applicative Architectures,” In Second Intl. Conf. on Logic Programming, Uppsala, July 1984.
C. S. Mellish, “An Alternative to Structure Sharing in the Implementation of a PROLOG Interpreter,” In Logic Programming, Ed. K. L. Clark and S.-A. Tärnlund, Academic Press, 1982, pp. 99–106.
M. J. O'Donnell, “Equational Logic as a Programming Language,” M.I.T. Press, 1985.
R. Onai, et al, “Architecture of a Reduction-based Parallel Inference Engine: PIMR,” In New Generation Computing, vol. 3, 1985, pp. 197–228.
U. S. Reddy, “Narrowing as the Operational Semantics of Functional Languages,” In 1985 Symp. on Logic Programming, Boston, 1985, pp. 138–151.
J. A. Robinson and E. E. Sibert, “LOGLISP: Motivation, Design, and Implementation,” In Logic Programming, Ed. K. L. Clark and S.-A. Tärnlund, Academic Press, 1982, pp. 299–313.
P. A. Subrahmanyam and J-H. You, “Pattern-driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional and Logical Programs,” In 11th ACM POPL, Salt Lake City, 1984, pp. 228–234.
D. H. D. Warren, F. Pereira, and L. M. Pereira, “Prolog: the Language and its Implementation Compared with LISP,” SIGPLAN Notices 12, No. 8 (1977) pp. 109–115.
J-H. You and P. A. Subrahmanyam, “Equational Logic Programming: an Extension to Equational Programming,” In 13th ACM POPL, St. Petersburg, 1986, pp. 209–218.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jayaraman, B., Gupta, G. (1987). Parallel execution of an equational language. In: Fasel, J.H., Keller, R.M. (eds) Graph Reduction. GR 1986. Lecture Notes in Computer Science, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18420-1_66
Download citation
DOI: https://doi.org/10.1007/3-540-18420-1_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18420-1
Online ISBN: 978-3-540-47963-5
eBook Packages: Springer Book Archive