Semantical Paradigms: Notes for an Invited Lecture

Abstract

It took the author a few years to understand the point of continuity in denotational semantics. He's 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1988
Accession Number
ADA202995

Entities

People

  • Albert R. Meyer
  • Stavros S. Cosmadakis

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Calculus
  • Classification
  • Complex Numbers
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Information Processing
  • Information Systems
  • Language
  • Mathematics
  • Numbers
  • Programming Languages
  • Real Numbers
  • Security
  • Standards
  • Theoretical Computer Science

Readers

  • Computational Linguistics
  • Educational Psychology