Functional models of procedural programs

This thesis shows how any Procedural Programming notation may be modelled by a purely Functional notation and discusses the applications and implications of this modelling approach. Existing ad hoc modelling techniques are gathered together within a common framework. The thesis shows that these techniques break down when the state of computation for a procedural language Is not an environment mapping from identifiers to denotable values. A simple method for overcoming this difficulty is Introduced, demonstrating that models may be constructed for all procedural programming notations. The modelling approach allows the considerable body of functional reasoning techniques to be brought to bear In the analysis of procedural programs. The thesis Introduces a simple technique called "Abstraction Projection", with which the programmer may project a model onto a sub domain suitable for a particular analytic task. Abstraction Projection removes from the model all details irrelevant to the computation of values within this sub domain. The thesis also provides semantic definitions for the terms "Functional Language", "Procedural Language" and "Referential Transparency".

Name dc:type.qualificationname

phd

Level dc:type.qualificationlevel

doctoral

Grantor dc:publisher.institution

Polytechnic of North London

Year dc:date.issued

1992

Author dc:creator

• Harman, Mark

• 000 Computer science, information & general works

Dc Identifier Grantnumber

N/A

OAI identifier oai:identifier

oai:repository.londonmet.ac.uk:7465