See this document in CiteSeerX!

Semantic Domains (1990)  (Make Corrections)  (117 citations)
C. A. Gunter, D. S. Scott
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
upenn.edu/~gunter/ftp/htcs90.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  upenn.edu/~gunter/publications (more)
Homepages:  C.Gunter  D.Scott
  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this report started working on denotational semantics in collaboration with Christopher Strachey. In order to fix some mathematical precision, he took over some definitions of recursion theorists such as Kleene, Nerode, Davis, and Platek and gave an approach to a simple type theory of higher-type functionals. It was only after giving an abstract characterization of the spaces obtained (through the construction of bases) that he realized that recursive definitions of types could be accommodated... (Update)

Cited by:   More
Model Checking and Abstraction - Edmund Clarke Carnegie (1992)   (Correct)
A Per Model of Polymorphism and Recursive Types - Abadi, Plotkin (1990)   (Correct)
Semantic Representations and Query Languages for Or-Sets - Libkin, Wong (1993)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Universal Profinite Domains - Gunter (1987)   (Correct)
0.6:   Coherence and Consistency in Domains - Gunter (1990)   (Correct)
0.5:   Domain Theory - Abramsky, Jung (1994)   (Correct)

Similar documents based on text:   More   All
0.1:   Predictable Programs in Barcodes - Alwyn Goodloe Michael (2002)   (Correct)
0.1:   L-domains and Lossless Powerdomains - Jagadeesan   (Correct)
0.1:   Cv - Bhargavan   (Correct)

Related documents from co-citation:   More   All
15:   Domains for denotational semantics (context) - Scott - 1982
15:   The category-theoretic solution of recursive domain equations (context) - Smyth, Plotkin - 1982
14:   The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984

BibTeX entry:   (Update)

C. Gunter and D. S. Scott. 12: Semantic Domains. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 633--674. Elsevier Science Publishers, Amsterdam, 1990. http://citeseer.ist.psu.edu/gunter90semantic.html   More

@incollection{ gunter90semantic,
    author = "Carl A. Gunter and Dana S. Scott",
    title = "Semantic Domains",
    booktitle = "Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)",
    pages = "633-674",
    year = "1990",
    url = "citeseer.ist.psu.edu/gunter90semantic.html" }
Citations (may not include all citations):
729   The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
245   A Compendium of Continuous Lattices (context) - Gierz, Hofmann et al. - 1980
214   Domains for denotational semantics (context) - Scott - 1982  ACM   DBLP
162   Data types as lattices (context) - Scott - 1976  DBLP
150   The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin - 1982  DBLP
146   A powerdomain construction (context) - Plotkin - 1976  ACM   DBLP
83   Power domains and predicate transformers: a topological view (context) - Smyth - 1983  DBLP
38   Lectures on a mathematical theory of computation (context) - Scott - 1982
34   Theoretical Computer Science (context) - Smyth, domains - 1977  ACM
30   Relating theories of the lambda calculus (context) - Scott - 1980
30   Algebra and combinators (context) - Engeler - 1981
21   The largest cartesian closed category of domains (context) - Smyth - 1983  DBLP
12   Some ordered sets in computer science (context) - Scott - 1981
12   The lambda calculus: some models (context) - Scott - 1980
10   Coherence and consistency in domains - Gunter, Jung - 1990
7   Theoretical Computer Science (context) - Kamimura, Tang et al. - 1984  ACM
4   The largest first-order axiomatizable cartesian closed categ.. (context) - Gunter - 1986
4   Logic and programming languages (context) - Scott - 1976  ACM   DBLP
3   A combinatory representation of varieties and universal clas.. (context) - Engeler
3   Stable models of typed -calculus (context) - Berry - 1978
2   Sets and the semantics of bounded nondeterminism (context) - Gunter - 1987
2   Journal of Computer System Sciences (context) - Smyth - 1978
1   Rule-based semantics for an extended lambda-calculus (context) - R'ev'esv - 1987  ACM   DBLP



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cis.upenn.edu/~gunter/publications.html):   More
Domain Theoretic Models Of Polymorphism - Coquand, Gunter (1989)   (Correct)
Inheritance As Implicit Coercion - Breazu-Tannen, Coquand, Gunter.. (1991)   (Correct)
Coherence and Consistency in Domains - Gunter (1990)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC