No label defined (Q3137150)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 426302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 426302 |
Statements
4 November 1993
0 references
strength
0 references
fibrations
0 references
strong datatypes
0 references
0.8522714376449585
0 references
0.8491895794868469
0 references
0.7491631507873535
0 references
An endofunctor of a Cartesian closed category is often called strong if it is enriched over the exponential. Equivalently this strength can be provided as a natural transformation \(\varphi_{A,X}: F(A)\times X\to F(A\times X)\) satisfying some elementary coherence conditions. This latter formulation does not require exponentials, relies only on the presence of an \(X\)-action, and thereby provides a first-order viewpoint of strength. The 2-category of \(X\)-strong categories is not finitely complete and, in particular, lacks lax limits such as comma categories and equifiers. However, strength can also be framed in terms of fibrations giving an embedding of \(X\)-strong categories into the 2-category of split fibrations over \(X\). This embedding provides a completion and the equifiers thereof can be used to provide a formulation of strong datatypes. A term logic for a programming language based on these strong datatypes is described by the authors [``Strong categorical datatypes. II: A term logic for categorical programming'', to appear in EATCS], following the ideas of \textit{T. Hagino} [``A categorical programming language'', Ph. D. Thesis, Univ. of Edinburgh (1987)] as modified by \textit{G. C. Wraith} [``A note on categorical datatypes'', Lect. Notes Comput. Sci. 389, 118-127 (1989)]. The universal properties of these strong datatype generate a strongly normalizing reduction system on points. The reduction rules suggest an ``eager'' interpretation of initial datatypes and a ``lazy'' interpretation for final datatypes. These reduction rules form the basis for computation in the Charity categorical programming system [the first author and \textit{T. Fukushima}, ``About Charity'', Univ. of Calgary, Department of Computer Science Technical Report 92/480/18 (1992)] which is available by ftp. For the entire collection see [Zbl 0771.00047].
0 references