Title :
Semantical paradigms: notes for an invited lecture
Author :
Meyer, Albert R. ; Cosmadakis, Stavros S.
Author_Institution :
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
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.<>
Keywords :
data structures; formal logic; programming languages; Scott domains; adequacy theorem; computationally adequate semantics; continuity; denotational semantics; goodness-to-fit criteria; lambda calculus with simple recursive types; semantic domains; symbolic evaluators; Calculus; Computer languages; Computer science; Information systems; Insulation; Logic; Natural languages; Program processors; Robustness; Weapons;
Conference_Titel :
Logic in Computer Science, 1988. LICS '88., Proceedings of the Third Annual Symposium on
Conference_Location :
Edinburgh, UK
Print_ISBN :
0-8186-0853-6
DOI :
10.1109/LICS.1988.5123
