Correctness of a lucid interpreter based on linked forest manipulation systems

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.