Edmund Robinson. Parametricity as isomorphism. Theoretical Computer Science, 136(1):163-181, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (1 citation) (Correct)
.... and Denotational Semantics: History, Accomplishments and Open Problems edited by Achim Jung with contributions by Marcelo Fiore Achim Jung Eugenio Moggi Peter O Hearn Jon Riecke Giuseppe Rosolini Ian Stark January 23, 1996 In this collection we try to give an overview of some selected topics in Domain Theory and Denotational Semantics. In doing so, we first ....
....closure. Neither CONT nor ALG is cartesian closed but from [Smy83a] and [Jun90] we know essentially all cartesian closed full subcategories. Among the maximal ones are FS domains (in the continuous case) and bifinite domains (in the algebraic case) see [AJ94b, Chapter 4] Recursive types pose no problem for ALG, CONT, nor for any of its cartesian closed subcategories. They are resolved by the fundamental technique of bilimits [AJ94b, Chapter 5] devised early on by Scott [Sco72] Adding algebraic structure in a free fashion is also possible [AJ94b, Section 6.1] but the general theorem applies ....
[Article contains additional citation context not shown here]
E. P. Robinson. Parametricity as isomorphism. Theoretical Computer Science. Accepted for publication.
Variations on Algebra: monadicity and generalisations of.. - Robinson (2001) (14 citations) Self-citation (Robinson) (Correct)
....Cat when everything is covariant, and enriched over Gpd where there is some contravariance. Enrichment over Cat guarantees the naturality of all constructions, while enrichment over Gpd only guarantees naturality with respect to isomorphisms, a fairly lowlevel form of parametricity as in Robinson [Rob94]. Moreover, we can treat a functor between categories as a two sorted algebra. This allows us to handle, for example, cartesian closed functors between cartesian closed categories. One concept which however seems not to be monadic over any integer power of Cat is the notion of bration. We do not ....
Edmund Robinson. Parametricity as isomorphism. Theoretical Computer Science, 136(1):163-181, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC