Skip to main content
SpringerLink
Log in

Semantic properties of Lucid's compute clause and its compilation

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Compilation algorithms for a subset of the programming language Lucid are extended so that programs with nested compute clauses can be compiled.

The extension is derived from the semantic properties of the compute clause construct, and is applicable to a broad class of compilation algorithms for a subset of Lucid. A correctness proof of the extension is also given.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ashcroft, E., Wadge, W.: Lucid — A formal system for writing and proving programs SIAM J. Comput. 5, 336–354 (1976)

    Google Scholar 

  2. Ashcroft, E., Wadge, W.: Lucid — Scope structures and defined functions. Conference Records: 5th Annl Symp. on Princ. of Progr. Lang., Tucson 1978, 17–23

  3. Chirica, L., Martin, D.: An approach to compiler correctness. Proceedings: Int. Conf. on Reliable Software, Los Angeles 1976, Sigplan Notices 10, 96–103

  4. Dahl, O., Dijkstra, E., Hoare, C.: Structured programming London: Academic Press 1972

    Google Scholar 

  5. Farah, M.: Correct compilation of a useful subset of lucid. Ph.D. Thesis, Dept. of Comp. Sci., University of Waterloo, 1977

  6. Hoffmann, C.: Design and correctness of a compiler for a nonprocedural language. Acta Informat. 9, 217–241 (1978)

    Google Scholar 

  7. Infante, R., Montanari, U.: Proving structured programs correct, level by level. Proceedings: Int. Conf. on Reliable Software, Los Angeles 1976, Sigplan Notices 10, 427–436

  8. Morris, F.: Advice on structuring compilers and proving them correct. Conferene Records: ACM Symp. on Princ. of Progr. Lang., Boston 1973, pp 144–152

  9. Vuillemin, J.: Correct and optimal implementation of recursion in a simple programming language. JCSS 9, 332–354 (1974)

    Google Scholar 

  10. Robinson, L., Levitt, K.: Proof techniques for hierarchically structured programs. CACM 20, 271–283 (1974)

    Google Scholar 

  11. Kowalski, R.: Predicate logic as programming language. Information Processing 1974, IFIP Congress Series 569–574

  12. Ashcroft, E., Wadge, W.: A logical programming language. RR CS-79-20, Dept. of Comp. Science, Univ. of Waterloo, 1979

  13. Ashcroft, E., Wadge, W.: Structured lucid. RR CS-79-21, Dept. of Comp. Science, Univ. of Waterloo, 1979

  14. Cargill, T.: Deterministic operational semantics for lucid. TR CS-76-19, Dept. of Comp. Science, Univ. of Waterloo, 1976

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Purdue University, West-Lafayette, IN, USA

    Christoph M. Hoffmann

Authors
  1. Christoph M. Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been supported in part by an NSF grant MCS 78-01812

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hoffmann, C.M. Semantic properties of Lucid's compute clause and its compilation. Acta Informatica 13, 9–20 (1980). https://doi.org/10.1007/BF00288532

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288532

Keywords

Search

Navigation