Re: [Haskell-cafe] Couple of formal questions

I'm not sure there's a proof as such, more like a definitional absence of distinction between initiality and finality. In other words, the CPO framework is orthogonal to such extremality considerations. Perhaps someone here knows about work enriching CPOs in that direction. -- Kim-Ee Michael Karcher-7 wrote:

Wouter Swierstra wrote:

...

Hi Creighton,

...

Where could I find a proof that the initial algebras & final coalgebras of CPO coincide? I saw this referenced in the "Bananas.." paper as a fact, but am not sure where this comes from.

Probably he was referring to the last paragraph of the introduction:

Working in CPO has the advantage that the carriers of intial algebras and final co-algebras coincide, thus there is a single data type that comprises both finite and infinite elements.

-- View this message in context: http://www.nabble.com/Couple-of-formal-questions-tp16974927p17020475.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.