Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-24T21:58:43.396Z Has data issue: false hasContentIssue false
  • English
  • Français

An imperative language based on distributive categories

Published online by Cambridge University Press:  04 March 2009

R. F. C. Walters
R. F. C. Walters
Affiliation:
School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia.
Get access Rights & Permissions [Opens in a new window]

Abstract

It is the contention of the author that there is a preferred categorical structure appropriate for the analysis of imperative programming languages, namely the existence of finite sums and products and a distributive law of products over sums. An imperative language based on these operations is described.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 2 , Issue 3 , September 1992 , pp. 249 - 256
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Arbib, M. A. and Manes, E. G. (1986) Algebraic approaches to program semantics, Springer, Verlag, , R., CockettDistibutie logic, Research Report CS-89–01, Department of Computer Science, University of Tennessee.Google Scholar
Lawvere, F. W. (1967) Theories as categories and the completeness theorem. J. of Symbolic Logic 32 562.Google Scholar
Mac Lane, S. (1971) Categories for the working mathematician. Graduate Texts in Mathematics 5, Springer Verlag.Google Scholar
Shu-Hao, Sun and Walters, R. F. C.Free distributive categories (in prepartion)Google Scholar
Walters, R. F. C. (1989) Data types in distributive categories. Bull. Austral. Math. Soc. 40 70–82.Google Scholar