WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/23950188

Semantic Domains and Denotational Semantics

All of these exercise assume the definitions and results in the paper Semantic Domains by Carl A. Gunter and D.S. Scott. Many exercises require some basic knowledge of category theory; the necessary definitions can all be found in subsections 1-5 of Chapter 0 of the book of J. Lambek and P.J. Sott or any book on category theory. The exercises below cover a wide range of levels of difficulty. In an effort to provide some guide to these levels, we have placed a single star * next to those exercise which we feel are more difficult than the average. An exercise is marked with two stars ** if it requires some specialized knowledge not included or require by the two references mentioned above (such as lambda-calculus, combinatory logic, set theory, topology, categorical logic, etc.). (KR).

Open All Close All

type

about

alternateName

http://schema.org/alternateName

  • "Logic, algebra and computation"@en

contributor

creator

description

http://schema.org/description

  • "All of these exercise assume the definitions and results in the paper Semantic Domains by Carl A. Gunter and D.S. Scott. Many exercises require some basic knowledge of category theory; the necessary definitions can all be found in subsections 1-5 of Chapter 0 of the book of J. Lambek and P.J. Sott or any book on category theory. The exercises below cover a wide range of levels of difficulty. In an effort to provide some guide to these levels, we have placed a single star * next to those exercise which we feel are more difficult than the average. An exercise is marked with two stars ** if it requires some specialized knowledge not included or require by the two references mentioned above (such as lambda-calculus, combinatory logic, set theory, topology, categorical logic, etc.). (KR)."@en
  • "This chapter discusses classes of mathematical structures suitable for use as the semantic domains of programming language constructs. Such structures play a significant role in the foundation of denotational semantics. Many categories of domains have been introduced to serve various purposes, but existing theories share several important characteristics. One such common concept is the view of partial elements provided by the theory. This concept of partiality is integral to the way the semantic domains we discuss can be used to model such programming language features as recursive definitions of functions and datatypes. A theory of computability on abstract spaces requires a concept of finite approximation which is also provided by the theory of semantic domains. These concepts must be defined for spaces that maintain the desired level of abstraction while still providing an intuitive explanation of computability for functions, functionals, and such programming constructs as higher-order procedures streams and so on. We discuss two classes of domains in some detail with an attempt to motivate the need for the conditions being imposed on the structures in computational terms. We have attempted to avoid heavy abstractions while trying to introduce the reader to several of the central concepts and techniques which are common to all of the approaches we might have taken. (edc)."@en

name

http://schema.org/name

  • "Semantic Domains and Denotational Semantics"
  • "Semantic Domains and Denotational Semantics"@en
  • "Semantic domains and denotational semantics"@en
  • "Semantic domains and denotational semantics"
  • "Semantic domains and denotational semantics : [working material for the lectures of Dana S. Scott, International Summer School on Logic, Algebra and Computation, Marktoberdorf, Germany, July 25 - Aug. 6, 1989]"

workExample