On a Connection between Procedural and Applicative Languages

Abstract

This paper reports on the connection between procedural and applicative languages. It presents features, notions and methods derived from abstract data type theory that in our judgement are helpful and necessary for multi-level software engineering environments in general, and especially for the treatment of verification issues there. Reference is made to an existing software engineering system and exemplary languages of it. A denotational semantics based on algebraic structures is introduced and employed. Since object-orientedness is looked at as one of the most important properties of such environments the notion of correctness is applied to objects and object relations. Finally a realistic semi-automatic method for the check of correctness criteria is given, accompanied by remarks on our existing implementation.