| C. Hoare, Specifications, programs and implementations, Technical Monograph PRG--29, Programming Research Group, Oxford University, 1982. |
....27 If Act contains two distinct actions, then CCT strictly includes CT , and is strictly included in TL . As CCT is easily seen to be a precongruence, Thm. 4. 20 yields the non existence of a finite inequational axiomatization for it over the language T(BPA The reader familiar with [40, 55] may have noticed the similarities between the notion of commutative regular algebra and the counter model for CSP [41] defined ibidem. The main difference between the two notions being that the counter model is based upon, not necessarily completed, traces. Remark: In [62, page 143] Salomaa ....
C. Hoare, Specifications, programs and implementations, Technical Monograph PRG--29, Programming Research Group, Oxford University, 1982.
....for the basic data types and functions of a programming language, and their homomorphisms can be viewed as data refinements. Considered in connection with the basic program construction operations of a language, this can lead to some general techniques for developing correct programs [40]. It would be interesting to extend this to more general variants of Lawvere theories (such as many sorted theories or sketches) and to the more general data representations studied in the abstract data type literature (e.g. 33, 9] 3.4 Program Homomorphisms. Because Example 2.7 defines ....
....but also serve as objects for some other, higherlevel, morphisms. This leads to 2 categories, of which the category Cat of categories is the canonical example, with natural transformations as morphisms of its morphisms. This concept was mentioned in Example 2. 7, and is also used in [24] 26] [40], 56] among other places, and is mentioned in [61] 8.2 Monoidal Categories. There are many cases where a category has a natural notion of multiplication that is not the usual Cartesian product but nevertheless enjoys many of the same properties. The category of Petri nets studied in [52] has ....
C.A.R. Hoare and Jifeng He. Natural transformations and data refinement, 1988. Programming Research Group, Oxford University.
....two distinct actions, then CCT strictly includes CT , and is strictly included in TL . As CCT is easily seen to be a precongruence, Thm. 4. 20 yields the nonexistence of a finite inequational axiomatization for it over the language T(BPA (Act) The reader familiar with [40, 55] may have noticed the similarities between the notion of commutative regular algebra and the counter model for CSP [41] defined ibidem. The main difference between the two notions being that the counter model is based upon, not necessarily completed, traces. Remark: In [62, page 143] Salomaa ....
C. Hoare, Specifications, programs and implementations, Technical Monograph PRG--29, Programming Research Group, Oxford University, 1982.
No context found.
A.W. Roscoe and C.A.R. Hoare. Laws of occam programming. Monograph PRG-53, Oxford University Computing Laboratory, Programming Research Group, February 1986.
No context found.
A. W. Roscoe and C. A. R. Hoare. Laws of occam programming. Technical Report PRG-53, Oxford University Computing Laboratory, Programming Research Group, 1986.
No context found.
C. A. R. Hoare et al. Data refinement refined. Typescript, Programming Research Group, Oxford University., May 1985.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC