Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.contributor.authorPower, John
dc.contributor.authorSannella, Donald
dc.contributor.authorTennent, Robert
dc.coverage.spatial17en
dc.date.accessioned2003-11-06T11:06:43Z
dc.date.available2003-11-06T11:06:43Z
dc.date.issued2000
dc.identifier.citationAUTOMATA LANGUAGES AND PROGRAMMING LECTURE NOTES IN COMPUTER SCIENCE 1853: 85-102 2000en
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/1842/223
dc.description.abstractLax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relations, they are preserved by the meanings of all lambda-calculus terms.We show that lax logical relations coincide with the correspondences of Schoett, the algebraic relations of Mitchell and the pre-logical relations of Honsell and Sannella on Henkin models, but also generalise naturally to models in cartesian closed categories and to richer languages.en
dc.format.extent525147 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherSPRINGER-VERLAGen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleLax Logical Relationsen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record