Abstract
It is known that if we have an interpreter I written in a language L1 which interprets programs written in a language L1, partially evaluating the interpreter with respect to some program ? will give a program which behaves as ? but is in language LI rather than Lp. The combination of interpreter and partial evaluator may therefore be used to translate from Lp to LI.
We discuss such a system in this paper, where Lp is a language close to Occam and LI the concurrent logic language FGDC (Flat Guarded Definite Clauses — a development from Parlog).
We give an interpreter for an Occam-like language in FGDC and some examples of partial evaluation techniques used on the interpreter to translate Occamlike code to FGDC.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Artificial Intelligence Ltd. Strand88 User Manual 1988.
R.M. Burstall and J. Darlington. A Transformation System for Developing Recursive Programs. Journal ACM 24, pp. 44–67 (1977).
M. Codish and E. Shapiro. Compiling OR-parallelism into AND parallelism. New Generation Computing 5, 1 pp.45–61 (1987).
D. Cohen, M.M. Huntbach and G.A.Ringwood. Logical Occam, in P.Kacsuk and M.Wise (eds) Distributed Prolog (to be published) Wiley, 1991.
E.W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Comm. ACM 18, 8 pp. 453–457 (1975).
H. Fujita, A.Okumura and K.Furukawa. Partial Evaluation of GHC Programs based on the UR-set with Constraints. In Proc. Fifth Int. Conf. on Logic Programming, pp.924-941. M.I.T. Press, 1988.
K. Furukawa, A. Okumura and M. Murukami. Unfolding Rules for GHC Programs. New Generation Computing 6, pp. 143–157 (1988).
K. Furukawa and K.Ueda. GHC Process Fusion by Program Transformation. In Proc. 2nd Annual Conf. of Japan Soc. of Software Science and Technology, pp.89-92. 1985.
J. Gallagher. Transforming Logic Programs by Specialising Interpreters. In European Conference on Artificial Intelligence (ECAI-86), Brighton, UK, 1986.
M. M. Huntbach. Meta-Interpreters and Partial Evaluation in Parlog. Formal Aspects of Computing 1, pp. 193–211 (1989).
G.A.Ringwood. Pattern-Directed, Markovian, Linear Guarded, Definite Clause Resolution. Tech.Rept. Dept. of Computing, Imperial College, 1987.
G.A. Ringwood. Parlog86 and the Dining Logicians. Comm. ACM 31, 1 pp.1-25 (1988).
E. Shapiro. The Family of Concurrent Logic Programming Languages. ACM Comp. Surveys 21, 3 pp. 412–510 (1989).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Huntbach, M. (1992). Automated Translation of Occam to a Concurrent Logic Language. In: Clement, T.P., Lau, KK. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3494-7_19
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3494-7_19
Publisher Name: Springer, London
Print ISBN: 978-3-540-19742-3
Online ISBN: 978-1-4471-3494-7
eBook Packages: Springer Book Archive