Abstract
It is already known that a Concurrent Prolog program can be compiled into an equivalent Prolog program. Using a Concurrent Prolog interpreter written in Prolog, we converted Concurrent Prolog programs step by step to compiled codes in Prolog. Each conversion step was successfully executed on a Prolog language processor. We examined how each conversion step contributed to performance improvement, using sample Concurrent Prolog programs such as a meta interpreter.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Hirsch, M., Silverman, W. and Shapiro, E., Layers of Protection and Control in the Logix System, CS86-19, Weizmann Instit., 1986
Kursawe, P., How to Invent a Prolog Machine, in Proc. of 3rd Inter. Conf. on Logic Prog., 1986, pp. 134–148
Shapiro, E., A Subset of Concurrent Prolog and Its Interpreter, Tech. rep. TR-003, ICOT, 1983
Ueda, K., and Chikayama, T., Concurrent Prolog Compiler on Top of Prolog, in Proc. of Symp. on Logic Prog., 1985, pp. 119–126
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kohda, Y., Tanaka, J. (1988). Deriving a compilation method for parallel logic languages. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '87. LP 1987. Lecture Notes in Computer Science, vol 315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19426-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-19426-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19426-2
Online ISBN: 978-3-540-39267-5
eBook Packages: Springer Book Archive