Achim Jung (Ed.)  Home/Search
Context Related
| disi.unige.it/person/M...tenyears.ps.gz cs.bham.ac.uk/pub/tec...CSR9602.ps.gz cs.bham.ac.uk/~axj/pub...tenyears.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: disi.unige.it/pers...publications (more) From: cs.bham.ac.uk/~axj/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this collection we try to give an overview of some selected topics in Domain Theory and Denotational Semantics. In doing so, we first survey the mathematical universes which have been used as semantic domains. The emphasis is on those ordered structures which have been introduced by Dana Scott in 1969 and which figure under the name (Scott-) domains. After surveying developments in the concrete theory of domains we describe two newer developments, the axiomatic and the synthetic approach. In ... (Update)
Context of citations to this paper: More
...mainly on the mathematical foundations of the various semantic approaches. An overview and survey of the research field is given in [Fior96]. According to the denotational approach, programming language semantics is described by attributing mathematical denotations to programs...
Cited by: More
A Formal Semantics for the C Programming Language - Nikolaos Papaspyrou Doctoral (1998) (Correct)
Similar documents (at the sentence level):
13.6%: Axiomatic Domain Theory - Fiore (1995) (Correct)
Active bibliography (related documents): More All
1.9: Domain Theory - Abramsky, Jung (1994) (Correct)
1.5: Domain Theory - Corrected and expanded version - Abramsky, Jung (Correct)
1.2: Kripke Logical Relations and PCF - O'Hearn, Riecke (1995) (Correct)
Similar documents based on text: More All
0.2: Multi Lingual Sequent Calculus and Coherent Spaces - Jung, Kegelmann, Moshier (1997) (Correct)
0.2: Hereditarily Sequential Functionals: A Game-Theoretic Approach to .. - Nickau (1996) (Correct)
0.1: A Note on Logical Relations Between Semantics and Syntax - Pitts (Correct)
Related documents from co-citation: More All
2: Programming Language (context) - Kernighan, Ritchie et al. - 1988
2: A Framework for Programming Denotational Semantics in C - Papaspyrou - 1996
2: The Semantics of the C++ Programming Language (context) - Wallace - 1995
BibTeX entry: (Update)
M. P. Fiore, A. Jung, E. Moggi, P. O'Hearn, J. Riecke, G. Rosolini and I. Stark, "Domains and Denotational Semantics: History, Accomplishments and Open Problems", Technical Report CSR-96-2, University of Birmingham, School of Computer Science, January 1996. http://citeseer.ist.psu.edu/jung96domains.html More
@article{ jung+:domdsh,
author = {M. P. Fiore and A. Jung and E. Moggi and
P. O'Hearn and J. Riecke and G. Rosolini and
I. Stark},
title = {Domains and Denotational Semantics: History,
Accomplishments and Open Problems},
journal = {Bulletin of the EATCS},
year = 1996,
volume = 59,
month = jun,
pages = {227--256},
note = {Also published as Technical Report CSR-96-2,
University of Birmingham School of Computer
Science},
url = {citeseer.ist.psu.edu/jung96domains.html} }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
505 Implementing Mathematics with the NuPrl Proof Development Sy.. - Constable, Allen et al. - 1986
434 A framework for defining logics - Harper, Honsell et al. - 1992
369 Information and Computation (context) - Moggi, computations - 1991
359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
325 Towards a theory of type structure (context) - Reynolds - 1974
306 LCF considered as a programming language (context) - Plotkin - 1977
266 Information and Computation (context) - Coquand, Huet et al. - 1988
265 Proof of correctness of data representations (context) - Hoare - 1972
245 A Compendium of Continuous Lattices (context) - Gierz, Hofmann et al. - 1980
214 Domains for denotational semantics (context) - Scott - 1982
211 Domain theory - Abramsky, Jung - 1994
194 The Formal Semantics of Programming Languages (context) - Winskel - 1993
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
163 Commentary on Standard ML (context) - Milner, Tofte - 1991
162 Data types as lattices (context) - Scott - 1976
152 Semantics of Programming Languages (context) - Gunter - 1992
150 The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin - 1982
147 abstraction and parametric polymorphism (context) - Reynolds - 1983
144 Full abstraction for PCF - Abramsky, Malacaria et al. - 1994
143 Theorems for free - Wadler - 1989
139 Type systems for programming languages (context) - Mitchell - 1990
132 Syntactic control of interference (context) - Reynolds - 1989
132 Interpr'etation fonctionelle et 'elimination des coupures da.. (context) - Girard - 1972
132 Syntactic control of interference (context) - Reynolds - 1978
131 The essence of Algol (context) - Reynolds - 1981
130 Full abstraction in the lazy lambda calculus (context) - Abramsky, Ong - 1993
125 Outline of a mathematical theory of computation (context) - Scott - 1970
118 Lambda Calculus Models of Programming Languages (context) - Morris - 1968
117 Semantic Domains - Gunter, Scott - 1990
109 Continuous lattices (context) - Scott - 1972
106 Observable properties of higher order functions that dynamic.. - Pitts, Stark - 1993
106 the observable properties of higher order functions that dyn.. - Pitts, Stark - 1993
96 A survey of the project AUTOMATH (context) - de Bruijn - 1980
84 A domain equation for bisimulation (context) - Abramsky - 1991
83 Topos Theory (context) - Johnstone - 1977
83 Powerdomains and predicate transformers: a topological view (context) - Smyth - 1983
81 Information and Computation (context) - Bruce, Longo et al. - 1990
77 Full abstraction for a simple parallel programming language (context) - Hennessy, Plotkin - 1979
75 Annals of Pure and Applied Logic (context) - Abramsky, in - 1991
72 The Theory of LEGO: A Proof Checker for the Extended Calculu.. - Pollack - 1995
72 Fully abstract models of typed lambda-calculi (context) - Milner - 1977
69 Relational properties of domains - Pitts - 1996
65 Sequential Algorithms and Functional Programming (context) - Curien - 1986
63 Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1990
60 Towards fully abstract semantics for local variables: Prelim.. (context) - Meyer, Sieber - 1988
59 Using powerdomains to generalize relational databases - Buneman, Jung et al. - 1991
59 Axiomatic Domain Theory in Categories of Partial Maps (context) - Fiore - 1994
58 A logic for parametric polymorphism - Plotkin, Abadi - 1993
58 Algebraically complete categories (context) - Freyd - 1991
56 Post-graduate lecture notes in advanced domain theory (context) - Plotkin - 1981
53 Lambda-definability in the full type hierarchy (context) - Plotkin - 1980
50 Polymorphism is not set-theoretic (context) - Reynolds - 1984
49 A co-induction principle for recursively defined domains - Pitts - 1994
48 Laboratory for Foundations of Computer Science (context) - Moggi, view et al. - 1990
48 measures and fractals via domain theory (context) - Edalat - 1995
48 Hereditarily sequential functionals - Nickau - 1994
47 Fully Abstract Models of Programming Languages (context) - Stoughton - 1988
46 Recursive types reduced to inductive types (context) - Freyd - 1990
45 New foundations for fixpoint computations: FIX-hyperdoctrine.. (context) - Crole, Pitts - 1992
45 Information and Computation (context) - Mitchell, inference - 1988
42 Information and Computation (context) - Robinson, Rosolini et al. - 1988
42 Extended type structure and filter lambda models (context) - Coppo, Dezani-Ciancaglini et al. - 1984
42 Categorical semantics of higher-order polymorphic lambda cal.. (context) - Seely - 1987
42 A Per model of polymorphism and recursive types - Abadi, Plotkin - 1990
39 The effective topos (context) - Hyland - 1982
39 Total sets and objects in domain theory (context) - Berger - 1993
39 Polymorphism is set theoretic (context) - Pitts - 1987
38 A type inference approach to reduction properties and semant.. (context) - Mitchell - 1990
38 Full abstraction for sequential languages: The state of the .. (context) - Berry, Curien et al. - 1985
37 dialogue games and PCF (context) - Hyland, Ong - 1995
37 A coinduction principle for recursive data types based on bi.. - Fiore - 1993
36 Remarks on algebraically compact categories (context) - Freyd - 1992
36 Recursion over realizability structures (context) - Amadio - 1989
35 Domain Theory and the Logic of Observable Properties (context) - Abramsky - 1987
34 Semantical paradigms: Notes for an invited lecture (context) - Meyer, Cosmadakis - 1988
34 Theoretical Computer Science (context) - Smyth, domains - 1977
33 Domain theoretic models of polymorphism - Coquand, Gunter et al. - 1989
33 Algebraic specification of data types: A synthetic approach (context) - Lehmann, Smyth - 1981
32 A Category-Theoretic Approach to the Semantics of Programmin.. (context) - Oles - 1982
31 Lisp and Symbolic Computation (context) - Stark, for - 1996
30 An investigation of a programming language with a polymorphi.. (context) - McCracken - 1979
30 Hypercoherences: A strongly stable model of linear logic - Ehrhard - 1993
29 Relational properties of recursively defined domains - Pitts - 1993
29 A short description of Another Logical Framework (context) - Augustsson, Coquand et al. - 1990
29 Theory and practice of sequential algorithms: The kernel of .. (context) - Berry, Curien - 1985
28 Notes on sconing and relators - Mitchell, Scedrov - 1992
28 The semantics of secondorder lambda calculus (context) - Bruce, Meyer et al. - 1990
28 The fixed point property in synthetic domain theory (context) - Taylor - 1991
28 Continuity and Effectiveness in Topoi (context) - Rosolini - 1986
27 volume 3 of Cambridge Studies in Advanced Mathematics (context) - Johnstone - 1982
27 Stable models of typed -calculi (context) - Berry - 1978
26 Realizability Toposes and Language Semantics (context) - Longley - 1995
26 From Algol to polymorphic linear lambdas calculus - O'Hearn, Reynolds - 1995
25 Recursive types in Kleisli categories - Simpson - 1992
24 Cambridge Tracts in Theoretical Computer Science (context) - Vickers, Logic - 1989
24 Fully abstract semantics for observably sequential languages (context) - Cartwright, Curien et al. - 1994
23 Parametricity and local variables (context) - O'Hearn, Tennent - 1995
23 The classification of continuous domains (context) - Jung - 1990
23 An axiomatisation of computationally adequate domain theoret.. - Fiore, Plotkin - 1994
23 Games and full abstraction for the lazy -calculus (context) - Abramsky, McCusker - 1995
22 Idealized Algol and its specification logic (context) - Reynolds - 1982
22 Semantical analysis of specification logic (context) - Tennent - 1990
22 Extensional models of polymorphism (context) - Breazu-Tannen, Coquand - 1988
22 Semantical analysis of specification logic (context) - O'Hearn, Tennent - 1993
21 Extensional PERs (context) - Freyd, Mulry et al. - 1990
21 Categorical data types in parametric polymorphism (context) - Hasegawa - 1994
21 A note on inconsistencies caused by fixpoints in a cartesian.. (context) - Huwig, Poign'e - 1990
21 The largest cartesian closed category of domains (context) - Smyth - 1983
21 Annals of Pure and Applied Logic (context) - Hyland, complete - 1988
21 functor categories and block structure (context) - Oles - 1985
20 A new characterization of lambda definability - Jung, Tiuryn - 1993
20 Type theory and recursion (context) - Plotkin - 1993
20 Full abstraction and the context lemma - Jim, Meyer - 1991
20 Full abstraction for the second order subset of an Algollike.. - Sieber - 1994
19 Notes for a course given at the Center for the Study of Lang.. (context) - Plotkin, predomains et al. - 1985
19 Sequentiality and strong stability (context) - Bucciarelli, Ehrhard - 1991
18 Information and Computation (context) - O'Hearn, Riecke et al. - 1995
18 Observable sequentiality and full abstraction - Cartwright, Felleisen - 1992
17 Domain Theory in Realizability Toposes (context) - Phoa - 1991
17 Linear lambda calculus and categorical models revisited - Benton, Bierman et al. - 1993
17 Program Verification in Synthetic Domain Theory - Reus - 1995
17 Representation independence and data abstraction (context) - Mitchell - 1986
16 of variable types: Fifteen years later (context) - Girard - 1986
16 Studying the fully abstract model of PCF within its continuo.. (context) - Jung, Stoughton - 1993
15 interference and the Yoneda embedding (context) - O'Hearn, Reddy - 1995
15 Linear logic and interference control (context) - O'Hearn - 1991
15 Algebraic types in PER models (context) - Hyland, Robinson et al. - 1990
15 An elementary theory of the category of sets (context) - Lawvere - 1964
14 Nondeterminism and fully abstract models (context) - Astesiano, Costa - 1980
14 The discrete objects in the effective topos (context) - Hyland, Robinson et al. - 1988
14 Mathematical Structures in Computer Science (context) - O'Hearn, for et al. - 1993
13 Passivity and independence (context) - Reddy - 1994
13 Full Abstraction and Semantic Equivalence (context) - Mulmuley - 1987
13 or what makes the free-list free (context) - Halpern, Meyer et al. - 1984
12 Effective domains and intrinsic structure (context) - Phoa - 1990
12 Fixed point constructions in order-enriched categories (context) - Wand - 1979
12 Mathematical Structures in Computer Science (context) - Longo, Moggi et al. - 1991
11 Progress in Theoretical Computer Science (context) - Zhang, Domains - 1991
11 Also published as Technical Report 363 (context) - Stark, Higher-Order et al. - 1994
11 Games for recursive types - Abramsky, McCusker - 1994
10 Algebraic completeness and compactness in an enriched settin.. (context) - Plotkin - 1995
10 categories and duality (context) - Smyth - 1991
10 Interdefinability of parallel operations in PCF (context) - Stoughton - 1991
10 Global state considered unnecessary: Object-based semantics .. (context) - Reddy - 1996
10 About modest sets (context) - Rosolini - 1990
10 Generalized Banach-Mazur functionals in the topos of recursi.. (context) - Mulry - 1981
9 Diagonal arguments and cartesian closed categories (context) - Lawvere - 1969
9 New steps towards full abstraction for local variables (context) - Sieber - 1993
9 Reflexive graphs and parametric polymorphism - Robinson, Rosolini - 1994
9 Observable algorithms on concrete data structures (context) - Curien - 1992
9 Domain theory in learning processes - Edalat - 1995
9 Algebraically compact functors (context) - Barr - 1992
8 Also published as Technical Report No (context) - Jones, PhD et al. - 1990
8 How complete is PER (context) - Robinson - 1989
8 Functorial parametricity (context) - Freyd, Robinson et al. - 1992
8 Realizability and Recursive Mathematics (context) - McCarty - 1984
7 The category of functors from state shapes to bottomless CPO.. (context) - Lent - 1993
7 Theoretical Computer Science (context) - Freyd - 1993
6 replete construction (context) - Hyland, Moggi - 1995
6 Notes on synthetic domain theory (context) - Rosolini - 1995
6 From term models to domains (context) - Phoa - 1994
5 Lecture notes on the domain interpretation of type theory (context) - Martin-Lof - 1983
5 Flat lattice models of typed -calculus (context) - Bloom, be - 1990
5 A type theoretic alternative to ISWIM (context) - Scott - 1969
5 Semantics of interference control (context) - Tennent - 1983
5 Parametricity of extensionally collapsed models of polymorph.. (context) - Hasegawa - 1991
4 Dialogue games and innocent strategies: An approach to inten.. - Hyland, Ong - 1993
4 Equationally fully abstract models of PCF (context) - Stoughton - 1990
4 eles Compl`ement Ad (context) - Berry - 1979
4 A general adequacy result for a linear functional language (context) - Brauner - 1994
4 A large cartesian closed category of domains (context) - Lamarche
3 An exper model for Quest (context) - Rosolini - 1992
3 The synthetic plotkin powerdomain (context) - Taylor, Phoa - 1990
3 Department of Computer Science (context) - Reddy, logic et al. - 1993
3 and semantics for nested databases (context) - Jung, Puhlmann et al. - 1995
3 Stable bistructure models of PCF - Winskel - 1994
2 To appear in Information and Computation (context) - Ad'amek, in et al. - 1993
2 Naive synthetic domain theory (context) - Reus, Streicher - 1994
2 Parametricity as isomorphism - Robinson
2 Available by ftp from theory (context) - Taylor, stone - 1995
2 Sequential functions on indexed domains and full abstraction.. - Brookes, Geva - 1993
1 On functors expressible in the ploymorphic typed lambda calc.. (context) - Reynolds, Plotkin - 1993
1 and higher-order polymorphism (context) - Bruce, Mitchell et al. - 1992
1 available from http://theory (context) - Hyland, Ong et al. - 1995
1 Manuscript available from http://www (context) - Fiore, on et al. - 1994
1 available from http://theory (context) - Moggi, applications - 1995
1 Factorisation systems on domains - Kegelmann - 1995
1 Re-grouping information in a domain theoretic data model - Puhlmann - 1995
Documents on the same site (http://www.disi.unige.it/person/MoggiE/publications.html): More
The Partial Lambda-Calculus - Moggi (1988) (Correct)
Typed Intermediate Languages for Shape-Analysis - Bellè, Moggi (1997) (Correct)
Monads, Shapely Functors and Traversals - Moggi, Bellè, Jay (1999) (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