Show simple item record

dc.contributor.authorMeyer, Albert R.en_US
dc.contributor.authorCosmadakis, Stavros S.en_US
dc.date.accessioned2023-03-29T14:31:33Z
dc.date.available2023-03-29T14:31:33Z
dc.date.issued1988-07
dc.identifier.urihttps://hdl.handle.net/1721.1/149140
dc.description.abstractIt tooke me quite a few years to understand the point of the continuity in denotational semantics. I'm happy to report below on some recent results which justify my muddle-headedness and help to explain the point too. What follows are some global comments on denotational semantics of teh kinds invited lecturers sometimes indulge themselves in, highlighting "goodness of fit" criteria between semantic domains and symbolic evaluators. For readers impatient with sketchy overviews, two appendices mostly by Cosmadakis provide the key parts of a long proof that Scott domains give a computationally adequate and fully abstract semantics for lambda calculus with simple recursive types.en_US
dc.relation.ispartofseriesMIT-LCS-TM-353
dc.titleSemantical Paradigms: Notes for an Invited Lectureen_US
dc.identifier.oclc18494402


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record