Logic in Computer Science (LICS 1988)

Invited Talk: Semantical paradigms: notes for an invited lecture (at LICS 1988)

Authors: Albert R. Meyer Stavros S. Cosmadakis

Abstract

To help understand the reason for continuity in denotational semantics, the author offers some global comments on goodness-to-fit criteria between semantic domains and symbolic evaluators. The appendices provide the key parts of a proof that Scott domains give a computationally adequate and fully abstract semantics for lambda calculus with simple recursive types

BibTeX

  @InProceedings{MeyerCosmadakis-Semanticalparadigms,
    author = 	 {Albert R. Meyer and Stavros S. Cosmadakis},
    title = 	 {Semantical paradigms: notes for an invited lecture},
    booktitle =  {Proceedings of the Third Annual IEEE Symp. on Logic in Computer Science, {LICS} 1988},
    year =	 1988,
    editor =	 {Yuri Gurevich},
    month =	 {July}, 
    pages =      {236--253},
    location =   {Edinburgh, Scotland, UK}, 
    note =       {Invited Talk},
    publisher =	 {IEEE Computer Society Press}
  }