Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.contributor.authorReynolds, John
dc.date.accessioned2003-11-05T12:59:58Z
dc.date.available2003-11-05T12:59:58Z
dc.date.issued1991
dc.identifier.urihttp://hdl.handle.net/1842/200
dc.description.abstractGiven a model of the polymorphic typed lambda calculus based upon a Cartesian closed category K, there will be functors from K to K whose action on objects can be expressed by type expressions and whose action on morphisms can be expressed by ordinary expressions. We show that if T is such a functor then there is a weak initial T-algebra and if, in addition, K possesses equalizers of all subsets of its morphism sets, then there is an initial T-algebra. These results are used to establish the impossibility of certain models, including those in which types denote sets and S ! S0 denotes the set of all functions from S to S0.en
dc.format.extent244789 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherInformation and Computationen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleOn Functors Expressible in the Polymorphic Typed Lambda Calculusen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record