Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.
Semantical paradigms: notes for an invited lecture
By: Cosmadakis, S.S.; Meyer, A.R.;
1988 / IEEE / 0-8186-0853-6
Description
This item was taken from the IEEE Periodical ' Semantical paradigms: notes for an invited lecture ' 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.<
Related Topics
Formal Logic
Lambda Calculus With Simple Recursive Types
Adequacy Theorem
Computationally Adequate Semantics
Continuity
Denotational Semantics
Goodness-to-fit Criteria
Symbolic Evaluators
Scott Domains
Calculus
Computer Science
Natural Languages
Weapons
Computer Languages
Program Processors
Robustness
Logic
Insulation
Information Systems
Data Structures
Programming Languages
Engineering
Semantic Domains
