Semantical Paradigms: Notes for an Invited Lecture
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE
Pagination or Media Count:
It took the author a few years to understand the point of continuity in denotational semantics. Hes happy to report below on some recent results which justify his muddle-headedness and help explain the point too. What follows are some global comments on denotational semantics of the kind 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.
- Computer Programming and Software