E.G. Manes and M.A. Arbib. Algebraic Appoaches to Program Semantics. Texts and Monogr. in Comp. Sci.,. Springer, Berlin, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Invariants, Bisimulations and the Correctness of Coalgebraic.. - Jacobs (1997) (Correct)
.... concepts, see [25, 13, 10, 12, 14, 5, 6] building on earlier work [29, 2, 15] Coalgebras consist of a state space together with a transition function and can be used to describe various kinds of dynamical systems, including automata, transition systems and hybrid systems, see e.g. [27, 20, 11]. A coalgebraic specification (as developed in [13] formally captures several crucial aspects of classes in object oriented languages: it consists of a (hidden) state space (typically written as X) to which a client has only limited access, together with several operations (or methods) which act ....
E.G. Manes and M.A. Arbib. Algebraic Appoaches to Program Semantics. Texts and Monogr. in Comp. Sci.,. Springer, Berlin, 1986.
Invariants, Bisimulations and the Correctness of Coalgebraic.. - Jacobs (Correct)
.... concepts, see [26, 14, 11, 13, 15, 5, 6] building on earlier work [30, 2, 17] Coalgebras consist of a state space together with a transition function and can be used to describe various kinds of dynamical systems, including automata, transition systems and hybrid systems, see e.g. [28, 22, 12] (or [16] for an introduction to the theory of coalgebras) A coalgebraic specification (as developed in [14] formally captures several crucial aspects of classes in object oriented languages: it consists of a (hidden) state space (typically written as X) to which a client only has limited ....
E.G. Manes and M.A. Arbib. Algebraic Appoaches to Program Semantics. Texts and Monogr. in Comp. Sci.,. Springer, Berlin, 1986.
A Tutorial on (Co)Algebras and (Co)Induction - Jacobs, Rutten (1997) (7 citations) (Correct)
....and coalgebras. The basic dichotomy may be described as construction versus observation. It may be found in process theory [50] data type theory [21, 25, 5, 40] including the theory of classes and objects in objectoriented programming [61, 30, 37, 35] semantics of programming languages [46] (denotational versus operational [64, 67, 6] and of lambda calculi [58, 59, 20, 31] automata theory [53] system theory [65, 34] natural language theory [10, 62] and many other fields. We assume that the reader is familiar with definitions and proofs by (ordinary) induction. As a typical ....
E.G. Manes and M.A. Arbib. Algebraic Appoaches to Program Semantics. Texts and Monogr. in Comp. Sci.,. Springer, Berlin, 1986.
Proof Principles for Datatypes with Iterated Recursion - Hensel, Jacobs (1997) (10 citations) (Correct)
No context found.
E.G. Manes and M.A. Arbib. Algebraic Appoaches to Program Semantics. Texts and Monogr. in Comp. Sci.,. Springer, Berlin, 1986.
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