* infinite trees
@ 2001-12-14 11:29 Jiri Adamek
0 siblings, 0 replies; only message in thread
From: Jiri Adamek @ 2001-12-14 11:29 UTC (permalink / raw)
To: categories net
What is actually a first reference for the fact that for every polynomial
endofunctor of Set a final coalgebra consists of all properly labelled
(finite and infinite) trees? I suspect the first authors to study this
were Arbib and Manes in their
"Parametrized data types do not need...", Information and control 52
(1982), 139-158.
However, it is obvious from that paper that Arbib and Manes were
definitely unaware of the general statement, which explains why they only
mention some special cases in their book in 1986.
Jiri Adamek
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
alternative e-mail address (in case reply key does not work):
J.Adamek@tu-bs.de
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2001-12-14 11:29 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2001-12-14 11:29 infinite trees Jiri Adamek
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).