Terminal Sequences for Accessible Endofunctors

by n.n.

@MISC{n.n._terminalsequences,
    author = {n.n.},
    title = {Terminal Sequences for Accessible Endofunctors},
    year = {}
}

173	Jirí Rosicky, Locally Presentable and Accessible Categories - Adamek - 1994
156	N.: A Final Coalgebra Theorem - Aczel, Mendler - 1989
117	Terminal coalgebras in well-founded set theory - Barr - 1993
115	A domain equation for bisimulation - Abramsky - 1991
104	A Hidden Agenda - Goguen, Malcolm - 2000
78	Denotational semantics of concurrency - Bakker, Zucker - 1982
69	Bisimulation for probabilistic transition systems: A coalgebraic approach - Vink, Rutten - 1999
38	Universal coalgebra: A theory of systems, Theoret - Rutten
25	Coalgebraic logic, Annals of Pure and Applied Logic 96 - Moss - 1999
21	An axiomatics for categories of coalgebras - Power, Watanabe - 1998
18	Algebraically compact functors - Barr - 1992
17	Some properties of set functors - Trnková - 1969
5	On the foundations of semantics: Nonstandard sets, metric spaces, partial orders - Turi, Rutten - 1998
4	Total vs. partial objects in denotational semantics - Abramsky
3	Guarded induction on coalgebras - Pavlovic - 1998
2	On the greatest point of a set functor, Theoret - Adamek, Koubek - 1995
1	Least point of a functor - Adamek, Koubek - 1979
1	The structure of categories of coalgebras. Submitted - Johnstone, Power, et al.
1	On transition systems and Non-wellfounded sets. Papers on General Topology and Applications - Lazic, Roscoe - 1996
1	Nonwell -founded Sets Modeled as Ideal Fixed Points. Information and Computation - Mislove, Moss, et al. - 1991