eCite Digital Repository

Toward a Calculus of Algorithms


Bulmer, M and Fearnley-Sander, DP and Stokes, TE, Toward a Calculus of Algorithms, Bulletin of the Australian Mathematical Society, 50, (1) pp. 81-89. ISSN 0004-9727 (1995) [Refereed Article]

DOI: doi:10.1017/S000497270000959X


We develop a generalised polynomial formalism which captures the concept of an algebra of piece-wise denned polynomials. The formalism is based on the Boolean power construction of universal algebra. A generalisation of the theory of substitution homomorphisms is developed. The abstract operation of composition of generalised polynomials in one variable is denned and shown to correspond to function composition. © 1994, Australian Mathematical Society. All rights reserved.

Item Details

Item Type:Refereed Article
Research Division:Mathematical Sciences
Research Group:Pure mathematics
Research Field:Combinatorics and discrete mathematics (excl. physical combinatorics)
Objective Division:Expanding Knowledge
Objective Group:Expanding knowledge
Objective Field:Expanding knowledge in the mathematical sciences
UTAS Author:Fearnley-Sander, DP (Mr Desmond Fearnley-Sander)
UTAS Author:Stokes, TE (Dr Timothy Stokes)
ID Code:21125
Year Published:1995
Web of Science® Times Cited:4
Deposited By:Mathematics
Deposited On:2001-08-01
Last Modified:2011-09-27

Repository Staff Only: item control page