15
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Correctness of a lucid interpreter based on linked forest manipulation systems

Pages 3-26 | Received 01 Mar 1979, Published online: 19 Mar 2007
 

Abstract

The non-procedural programming language Lucid is described formally using a model based on linked forest manipulation systems. In this model the semantics is defined com-putationally by an abstract interpreter which is essentially non-deterministic and involves parallelism. This computational semantics is proven to be totally correct with respect to the denotational semantics of Lucid.

C.R. Categories:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.