Definite Descriptions and Dijkstra's Odd Powers of Odd Integers Problem

Authors:
Hugh Gibbons
Affiliations:
Computer Science Dept., Trinity College, Dublin, Ireland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 7
Cited 1

An introduction to the theory of lists

Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
Programming from specifications

Programming from specifications
Derivation of Invariant Assertions During Program Development by Transformation

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Science of Programming

The Science of Programming
Selected writings on computing: a personal perspective

Selected writings on computing: a personal perspective
A Discipline of Programming

A Discipline of Programming
Algorithmic Language and Program Development

Algorithmic Language and Program Development

A novel algorithm for all pairs shortest path problem based on matrix multiplication and pulse coupled neural network

Digital Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of Frege-Russell style definite descriptions for giving meaning to functions has been long established and we investigate their use in the development of Functional Programs and from these to the development of correct imperative programs. In particular, we investigate the development of a functional program for a problem, ''Odd powers of odd integers'', discussed by Dijsktra. If the correctness of termination is not a concern then it is straightforward to develop a partially correct program. Further properties of the specification are needed to develop a totally correct program.