Article View: comp.lang.functional
Article #70Polynomial functors (in categorical datatypes)
From: David Skillicorn
Date: Wed, 22 Jul 1992 16:51
Date: Wed, 22 Jul 1992 16:51
22 lines
1217 bytes
1217 bytes
I'm pretty sure that polynomial functors are not what's
really needed to make Malcolm-style datatype constructions
in BMF work. There's a paper from the group at Calgary
(Cockett et al.) from which I gather that strength is
the real property of importance. This can be arranged
in several ways, one of which is to use a polynomial
functor in a CCC. Some people (Bob Walters for one)
would argue that this is the wrong setting, and prefer
distributive categories.
Anyway it seems possible to get the kind of benefits
that the CDT construction gives without needing
the polynomial restriction.
But we're getting a bit far from the centre of this
newsgroup.
The Calgary work can be obtained by ftp from
cpsc.ucalgary.ca in directory pub/charity/PAPERS.
-david skillicorn
Technical Details
Message-ID:
<1992Jul22.165153.737@qucis.queensu.ca>Path:
arc1-ca.pugleaf.net!sparky!uunet!wupost!cs.utexas.edu!torn!news.ccs.queensu.ca!qucis.queensu.ca!skillShow Full Headers
Complete Article Headers
Newsgroups: comp.lang.functional Path: arc1-ca.pugleaf.net!sparky!uunet!wupost!cs.utexas.edu!torn!news.ccs.queensu.ca!qucis.queensu.ca!skill From: skill@qucis.queensu.ca (David Skillicorn) Subject: Polynomial functors (in categorical datatypes) Message-ID: <1992Jul22.165153.737@qucis.queensu.ca> Organization: Computing & Information Science, Queen's University Date: Wed, 22 Jul 1992 16:51:53 GMT Lines: 23