J.J.M.M. Rutten  Home/Search
Context Related
| cwi.nl/ftp/CWIreports/A...CSR9652.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: info4u.cwi.nl/static/pu...CS1996 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the semantics of programming, finite data types such as finite lists, have traditionally been modelled by initial algebras. Later final coalgebras were used in order to deal with infinite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models for certain types of automata and more generally, for (transition and dynamical) systems. An important property of initial algebras is that they satisfy the familiar principle of induction. Such a... (Update)
Cited by: More
Test Case Selection for Dynamic Systems by Unfolding of Modal .. - Aiguier, Longuet (Correct)
History Dependent Automata - Montanari, Pistore (2001) (Correct)
Modeling Fresh Names in the π-calculus Using.. - Bruni, Honsell, Lenisa.. (2002) (Correct)
Active bibliography (related documents): More All
0.5: An Application Of Coinductive Stream Calculus To Signal Flow Graphs - Rutten (2003) (Correct)
0.5: From Set-theoretic Coinduction to Coalgebraic Coinduction: some.. - Lenisa (1999) (Correct)
0.4: A Tutorial on (Co)Algebras and (Co)Induction - Jacobs, Rutten (1997) (Correct)
Similar documents based on text: More All
1.2: On Tree Coalgebras and Coalgebra Presentations - Adamek, Porst (2002) (Correct)
1.1: Logics Admitting Final Semantics - Kurz (Correct)
1.0: Elements of Stream Calculus (an Extensive Exercise in Coinduction) - Rutten (Correct)
Related documents from co-citation: More All
38: An Approach to Object Semantics based on Terminal Co-algebras (context) - Reichel - 1995
26: Objects and classes (context) - Jacobs - 1996
22: A final coalgebra theorem (context) - Aczel, Mendler - 1989
BibTeX entry: (Update)
J. Rutten. Universal coalgebra: a theory of systems. Theor. Comp. Sci., 1999. To appear. http://citeseer.ist.psu.edu/rutten96universal.html More
@article{ rutten00universal,
author = "J. J. M. M. Rutten",
title = "Universal coalgebra: a theory of systems",
journal = "Theoretical Computer Science",
volume = "249",
number = "1",
pages = "3--80",
year = "2000",
url = "citeseer.ist.psu.edu/rutten96universal.html" }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin - 1981
502 Concurrency and automata on infinite sequences (context) - Park - 1981
322 volume 92 of Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
247 Bisimulation through probabilistic testing (context) - Larsen, Skou - 1991
182 Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1992
176 An introduction to chaotic dynamical systems (context) - Devaney - 1986
150 The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin - 1982
144 Models for concurrency - Winskel, Nielsen - 1995
121 An approach to object semantics based on terminal coalgebras (context) - Reichel - 1995
102 Formal verification of parallel programs (context) - Keller - 1976
99 volume 5 of Graduate Texts in Mathematics (context) - Lane, the et al. - 1971
91 A final coalgebra theorem (context) - Aczel, Mendler - 1989
84 A domain equation for bisimulation (context) - Abramsky - 1991
77 Full abstraction for a simple parallel programming language (context) - Hennessy, Plotkin - 1979
72 Objects and classes (context) - Jacobs - 1996
69 Relational properties of domains - Pitts - 1996
69 Information and Computation (context) - Joyal, Nielsen et al. - 1996
67 Terminal coalgebras in well-founded set theory (context) - Barr - 1993
67 terminal coalgebras in well-founded set theory (context) - Barr, corrections - 1994
52 Center for the Study of Language and Information (context) - Goldblatt, time et al. - 1987
52 Center for the Study of Language and Information (context) - Goldblatt, modality et al. - 1993
52 Algebraic approaches to program semantics (context) - Manes, Arbib - 1986
49 A co-induction principle for recursively defined domains - Pitts - 1994
45 Universal algebra (context) - Meinke, Tucker - 1992
42 EATCS Monographs on Theoretical Computer Science (context) - Schmidt, Strohlein et al. - 1993
41 Center for the Study of Languages and Information (context) - Aczel, Number et al. - 1988
41 Information and Computation (context) - van Glabbeek, Smolka et al. - 1995
40 Solving reflexive domain equations in a category of complete.. (context) - America, Rutten - 1989
37 Mongruences and cofree coalgebras - Jacobs - 1995
37 A coinduction principle for recursive data types based on bi.. - Fiore - 1996
33 Algebraic specification of data types: A synthetic approach (context) - Lehmann, Smyth - 1981
31 Structural induction and coinduction in a fibrational settin.. - Hermida, Jacobs - 1996
30 Inheritance and cofree constructions - Jacobs - 1996
30 Functorial operational semantics and its denotational dual (context) - Turi - 1996
27 Center for the Study of Language and Information (context) - Barwise, Moss et al. - 1996
26 volume 26 of Graduate Texts in Mathematics (context) - Manes - 1976
24 Processes: a mathematical model of computing agents (context) - Milner - 1975
22 Processes as terms: Non-well-founded models for bisimulation (context) - Rutten - 1992
20 towards universal coalgebra (context) - Rutten, of et al. - 1995
18 Final semantics for a higher-order concurrent language - Lenisa - 1996
18 Final universes of processes - Aczel - 1994
17 Foundations of Computing Series (context) - de Bakker, de Vink et al. - 1996
16 Reidel Publishing Company (context) - Cohn, volume et al. - 1981
16 The metric closure powerspace construction (context) - Kent - 1988
16 Handbook of categorical algebra 1: basic category theory (context) - Borceux - 1994
14 Parametrized data types do not need highly constrained param.. (context) - Arbib, Manes - 1982
14 Processes and hyperuniverses - Forti, Honsell et al. - 1994
14 the foundations of final coalgebra semantics: nonwell -found.. - Turi, Rutten - 1997
13 Final semantics for untyped -calculus (context) - Honsell, Lenisa - 1995
5 Behaviour-refinement of object-oriented specifications with .. (context) - Jacobs - 1996
3 A small final coalgebra theorem - Kawahara, Mori - 1996
2 Journal of Pure and Applied Algebra (context) - Arbib, Manes et al. - 1980
1 Universit'e de Marne-la-Vall'ee (context) - B'eal, Perrin et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://info4u.cwi.nl/static/publications/reports/CS-1996.html): More
Logging in a Computational Steering Environment - Mulder, van Wijk (1995) (Correct)
3D Computational Steering with Parametrized Geometric Objects - Mulder, van Wijk (1995) (Correct)
Implicit Induction Techniques for the Verification of PIM - a .. - Naidich, Dinesh (1996) (Correct)
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