Show simple item record

dc.contributor.authorAbadi, Martin
dc.contributor.authorPierce, Benjamin
dc.contributor.authorPlotkin, Gordon
dc.date.accessioned2003-11-03T10:09:16Z
dc.date.available2003-11-03T10:09:16Z
dc.date.issued2003-11-03T10:09:16Z
dc.identifier.urihttp://hdl.handle.net/1842/181
dc.description.abstractWe explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yields a close fit between models and programming language. Two of our semantics of type expressions are faithful, in the sense that programs that behave identically in all contexts have exactly the same types.en
dc.format.extent262121 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectPolymorphismen
dc.subjectrecursive typesen
dc.subjectfull abstractionen
dc.subjectidealsen
dc.subjectmetric modelsen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleFAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPESen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record