Skip to main content

Automated Translation of Occam to a Concurrent Logic Language

  • Conference paper
Logic Program Synthesis and Transformation

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 34 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Artificial Intelligence Ltd. Strand88 User Manual 1988.

    Google Scholar 

  2. R.M. Burstall and J. Darlington. A Transformation System for Developing Recursive Programs. Journal ACM 24, pp. 44–67 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Codish and E. Shapiro. Compiling OR-parallelism into AND parallelism. New Generation Computing 5, 1 pp.45–61 (1987).

    Article  MATH  Google Scholar 

  4. 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.

    Google Scholar 

  5. E.W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Comm. ACM 18, 8 pp. 453–457 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  6. 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.

    Google Scholar 

  7. K. Furukawa, A. Okumura and M. Murukami. Unfolding Rules for GHC Programs. New Generation Computing 6, pp. 143–157 (1988).

    Article  MATH  Google Scholar 

  8. 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.

    Google Scholar 

  9. J. Gallagher. Transforming Logic Programs by Specialising Interpreters. In European Conference on Artificial Intelligence (ECAI-86), Brighton, UK, 1986.

    Google Scholar 

  10. M. M. Huntbach. Meta-Interpreters and Partial Evaluation in Parlog. Formal Aspects of Computing 1, pp. 193–211 (1989).

    Article  Google Scholar 

  11. G.A.Ringwood. Pattern-Directed, Markovian, Linear Guarded, Definite Clause Resolution. Tech.Rept. Dept. of Computing, Imperial College, 1987.

    Google Scholar 

  12. G.A. Ringwood. Parlog86 and the Dining Logicians. Comm. ACM 31, 1 pp.1-25 (1988).

    Google Scholar 

  13. E. Shapiro. The Family of Concurrent Logic Programming Languages. ACM Comp. Surveys 21, 3 pp. 412–510 (1989).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics