{"id":{"repo_id":"london-metro","oai_identifier":"oai:repository.londonmet.ac.uk:7465"},"canonical_url":"https://search.dev.ndltd.org/etd/london-metro/oai:repository.londonmet.ac.uk:7465","repository":{"repo_id":"london-metro","name":"London Metropolitan University","base_url":"https://repository.londonmet.ac.uk/cgi/oai2"},"display":{"title":"Functional models of procedural programs","abstract":"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\".","abstract_html":"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".","abstract_has_math":false,"creators":["Harman, Mark"],"institution":"Polytechnic of North London","degree_name":"phd","degree_level":"doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1992,"date_issued":"1992-09","date_published":"1992-09","updated_at":"2026-07-24T02:54:38Z","subjects":["000 Computer science, information & general works"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.grantnumber","label":"Dc Identifier Grantnumber","values":["N/A"],"render_values":[{"text":"N/A","href":null,"code":true}]}]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["London Metropolitan University"]},{"key":"dc:creator","label":"Author","values":["Harman, Mark"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1992-09"]},{"key":"dc:date.issued","label":"Date","values":["1992-09"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["School of Computing and Digital Media (SCDM)","School of Computing and Digital Media"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["Polytechnic of North London"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://repository.londonmet.ac.uk/7465/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["phd"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["000 Computer science, information & general works"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.grantnumber","label":"Dc Identifier Grantnumber","values":["N/A"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://repository.londonmet.ac.uk/7465/1/315232.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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\"."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dc:title","label":"Title","values":["Functional models of procedural programs"]}]}],"canonical_facts":{"dc:contributor.sponsor":["London Metropolitan University"],"dc:creator":["Harman, Mark"],"dc:date":["1992-09"],"dc:date.issued":["1992-09"],"dc:description.abstract":["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\"."],"dc:format":["text"],"dc:identifier.grantnumber":["N/A"],"dc:identifier.uri":["https://repository.londonmet.ac.uk/7465/1/315232.pdf"],"dc:publisher.department":["School of Computing and Digital Media (SCDM)","School of Computing and Digital Media"],"dc:publisher.institution":["Polytechnic of North London"],"dc:relation.isreferencedby":["https://repository.londonmet.ac.uk/7465/"],"dc:subject":["000 Computer science, information & general works"],"dc:title":["Functional models of procedural programs"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["doctoral"],"dc:type.qualificationname":["phd"]},"updated_at":"2026-07-24T02:54:38Z"}