The University of Southampton
University of Southampton Institutional Repository

Exploring Summation and Product Operators in the Refinement Calculus

Exploring Summation and Product Operators in the Refinement Calculus
Exploring Summation and Product Operators in the Refinement Calculus
Product and summation operators for predicate transformers were introduced by Naumann and by Martin using category theoretic considerations. In this paper, we formalise these operators in the higher order logic approach to the refinement calculus of Back and von Wright, and examine various algebraic properties of these operators. There are several motivating factors for this analysis. The product operator provides a model of simultaneous execution of statements, while the summation operator provides a simple model of late binding. We also generalise the product operator slightly to form an operator that corresponds to conjunction of specifications. We examine several applications of the these operators showing, for example, how a combination of the product and summation operators could be used to model inheritance in an object-oriented programming language.
Back, R.J.R.
cf7035e9-f227-4229-850e-02394850ec0e
Butler, M.J.
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Möller, B.
6c18df4f-c04e-443f-babe-8d7d591c18b5
Back, R.J.R.
cf7035e9-f227-4229-850e-02394850ec0e
Butler, M.J.
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Möller, B.
6c18df4f-c04e-443f-babe-8d7d591c18b5

Back, R.J.R. and Butler, M.J. (1995) Exploring Summation and Product Operators in the Refinement Calculus. Möller, B. (ed.) Mathematics of Program Construction.

Record type: Conference or Workshop Item (Paper)

Abstract

Product and summation operators for predicate transformers were introduced by Naumann and by Martin using category theoretic considerations. In this paper, we formalise these operators in the higher order logic approach to the refinement calculus of Back and von Wright, and examine various algebraic properties of these operators. There are several motivating factors for this analysis. The product operator provides a model of simultaneous execution of statements, while the summation operator provides a simple model of late binding. We also generalise the product operator slightly to form an operator that corresponds to conjunction of specifications. We examine several applications of the these operators showing, for example, how a combination of the product and summation operators could be used to model inheritance in an object-oriented programming language.

Other
a94-152.ps - Other
Download (374kB)

More information

Published date: 1995
Venue - Dates: Mathematics of Program Construction, 1995-01-01
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 250967
URI: http://eprints.soton.ac.uk/id/eprint/250967
PURE UUID: 97526f73-2d97-4ad5-8587-a111eef4bf12
ORCID for M.J. Butler: ORCID iD orcid.org/0000-0003-4642-5373

Catalogue record

Date deposited: 07 Oct 1999
Last modified: 15 Mar 2024 02:50

Export record

Contributors

Author: R.J.R. Back
Author: M.J. Butler ORCID iD
Editor: B. Möller

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×