Results

**1 - 6**of**6**### Inductive Datatypes with Laws and Subtyping – A Relational Model

- Faculty of Mathematics and Computing

"... ..."

(Show Context)
### unknown title

"... 6. Farber, D.J., and Larson, K,C. The structure of a distributed computing system--the communication system. Proc. Symp. ..."

Abstract
- Add to MetaCart

(Show Context)
6. Farber, D.J., and Larson, K,C. The structure of a distributed computing system--the communication system. Proc. Symp.

### unknown title

"... Abstract: This paper is about the design of data types in creating a software system. The major point is to explore a means for specifying a data type which is independent of its eventual implementation. The particular style of specification, caged algebraic axioms, is exhibited by axiomatizing many ..."

Abstract
- Add to MetaCart

Abstract: This paper is about the design of data types in creating a software system. The major point is to explore a means for specifying a data type which is independent of its eventual implementation. The particular style of specification, caged algebraic axioms, is exhibited by axiomatizing many commonly used data types. As such, these examples reveal a great deal about the intricacies of data type specification via algebraic axioms, and, in addition, provide a standard to which alternative forms may be compared. Further uses of this specification technique are in proving the correctness of implementations and in interpretively executing a large system design before actual implementation commences. Indez terms: data type, specification, algebraic axioms, software design, recursive programming, program correctness. 1.

### unknown title

"... 6. Farber, D.J., and Larson, K,C. The structure of a distributed computing system--the communication system. Proc. Symp. ..."

Abstract
- Add to MetaCart

(Show Context)
6. Farber, D.J., and Larson, K,C. The structure of a distributed computing system--the communication system. Proc. Symp.

### AND

"... ABSTRACT Many apparently divergent approaches to specifying formal semantics of programmmg languages are applications of mmal algebra semantics In this paper an overview of imtial algebra semantics t provided The major technical feature ts an mmal continuous algebra which permits unified algebraic t ..."

Abstract
- Add to MetaCart

(Show Context)
ABSTRACT Many apparently divergent approaches to specifying formal semantics of programmmg languages are applications of mmal algebra semantics In this paper an overview of imtial algebra semantics t provided The major technical feature ts an mmal continuous algebra which permits unified algebraic treatment of lteratlve and recurslve semantic features in the same framework as more basic operations