论文信息 - Semantic properties of Lucid's compute clause and its compilation

Semantic properties of Lucid's compute clause and its compilation

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.

Christoph M. Hoffmann

[1] F. Lockwood Morris,et al. Advice on structuring compilers and proving them correct , 1973, POPL.

[2] Robert A. Kowalski,et al. Predicate Logic as Programming Language , 1974, IFIP Congress.

[3] William W. Wadge,et al. Lucid - A Formal System for Writing and Proving Programs , 1976, SIAM J. Comput..

[4] David F. Martin,et al. An approach to compiler correctness , 1975 .

[5] U. Montanary,et al. Proving structured programs correct, level by level , 1975 .

[6] Mansour Farah. Correct compilation of a useful subset of lucid. , 1977 .

[7] Jean Vuillemin. Correct and Optimal Implementations of Recursion in a Simple Programming Language , 1974, J. Comput. Syst. Sci..

[8] Edsger W. Dijkstra,et al. Structured programming , 1972, A.P.I.C. Studies in data processing.

[9] Christoph M. Hoffmann,et al. Design and correctness of a compiler for a non-procedural language , 1978, Acta Informatica.

[10] William W. Wadge,et al. Clauses: scope structures and defined functions in Lucid , 1978, POPL '78.

[11] Lawrence Robinson,et al. Proof techniques for hierarchically structured programs , 1977, CACM.