Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, and James Worrell. An axiomatics for categories of transition systems as coalgebras. In Proc. Logic in Computer Science, pages 207-213, 1998. 9 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Observational Truth as a Categorical Modality - Malcolm (2002) (Correct)
.... most notably for our purposes Goldblatt [11] and Ghilardi and Meloni [5] Our own interest in these languages arose from a result of Worrell s stating that categories of models of hidden algebraic speci cations form a topos [27] the result holds more generally for coalgebras of certain functors [15]) We give a brief overview of hidden algebra Section 2 below. Since hidden algebra allows hierarchically structured speci cations, it is of interest to examine to what extent the logical languages of the toposes of models can also be hierarchically structured. This, however, is beyond the scope ....
Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, and James Worrell. An axiomatics for categories of transition systems as coalgebras. In Proc. Logic in Computer Science, pages 207-213, 1998. 9
Axiomatics for Data Refinement in Call By Value Programming.. - Power, Tanaka Self-citation (Power) (Correct)
....2 to Rel 2M ; the condition we need is that M weakly preserves pullbacks, i.e. that if W Z is a pullback, then the diagram MW MX MY MZ satisfies the existence part of the definition of pullback. This condition is the central condition used to analyse functional bisimulation in [9] with several of the same examples. Examples of such monads are powerdomains, S ) S20) for a set S, as used for modelling side effects, and similarly for monads used for modelling partiality, or exceptions, or combinations of the above. It does not seem to hold of the monad (0 ) R) R as has ....
Johnstone, P.T., Power, A.J., Tsujishita, T., Watanabe, H., Worrell, J.: An Axiomatics for Categories of Transition Systems as Coalgebras. Proc LICS 98. IEEE Press (1998) 207--213.
The Subobject Classifier of the Category of Functional.. - Watanabe (1998) (1 citation) Self-citation (Watanabe) (Correct)
....NDyn is a category of coalgebras for finite powerset functor without empty set. We can brush up the technique which is used in this paper, to an existence theorem[7] of subobject classifiers in categories of coalgebras by using accessible category theory, which led to another existential proof[3] in the context of topos theory. It is generally difficult to describe explicitly the structure of the subobject classifiers for coalgebra categories even if they exist. However there are a few exceptional cases. One is in [9, 8] where the truth value object of NDyn was given as a universe of ....
....to describe explicitly the structure of the subobject classifiers for coalgebra categories even if they exist. However there are a few exceptional cases. One is in [9, 8] where the truth value object of NDyn was given as a universe of hereditarily finite hypersets. Another example was given in [3] for the categories of coalgebras of finite powerset functor. The significance and applications of the existence of subobject classifier in NDyn have not been fully considered yet. But we can show it implies the regularity of NDyn[7, 3] and hence we can define category of relations over NDyn ....
[Article contains additional citation context not shown here]
Johnstone P., Power J., Tsujishita T., Watanabe H. and Worrell J., An Axiomatics for Categories of Transition Systems as Coalgebras, in Proceedings of Thirteenth Annual IEEE Symposium on Logic in Computer Science, IEEE, 1998, pp 207-213.
A Coalgebraic Foundation for Linear Time Semantics - Power, Turi (1999) (3 citations) Self-citation (Power) (Correct)
....often refer to a coalgebra hX; hi simply by its carrier X or by its structure h : X Fnan Fnan H(X) The H coalgebras form a category H Coalg with morphisms f : hX; hi Fnan Fnan hX 0 ; h 0 i given by maps f : X Fnan Fnan X 0 in C such that h 0 ffi f = H(f) ffi h. Cf [18]. We write I d for the identity endofunctor and we denote by P = hP; f Gammag; S i the non empty powerset monad, mapping a set X to the set PX of its nonempty subsets, having as unit the singleton map f Gammag : I d Fnan Fnan P and as multiplication the big union operation S : P ....
P.T. Johnstone, A.J. Power, T. Tsujishita, H. Watanabe, and J. Worrell. An axiomatics for categories of transition systems as coalgebras. In LICS: IEEE Symposium on Logic in Computer Science, 1998.
Coalgebras in Specification and Verification for Object-Oriented.. - Jacobs (1999) (1 citation) (Correct)
No context found.
P.T. Johnstone, A.J. Power, T. Tsujishita, H. Watanabe, and J. Worrell. An axiomatics for categories of transition systems as coalgebras. In Logic in Computer Science. IEEE, Computer Science Press, 1998.
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