Samson Abramsky, Achim Jung  Home/Search
Context Related
Links: ACM | cs.bham.ac.uk/~axj/pub/pa...handy.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: cs.bham.ac.uk/~axj/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Least fixpoints as meanings of recursive definitions. (Update)
Cited by: More
Unknown - Url Http Www (Correct)
Electronic Notes in Theoretical Computer Science 45 (2001) - Url Http Www (Correct)
Math. Struct. in Comp. Science (2004), vol. 14, pp.. - Cambridge University Press (Correct)
Similar documents (at the sentence level):
71.2%: Domain Theory - Corrected and expanded version - Abramsky, Jung (Correct)
Active bibliography (related documents): More All
18.5: Domain Theory - Abramsky, Jung (1994) (Correct)
1.9: Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (Correct)
0.8: Decomposition of Domains - Achim Jung (1990) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Christopher Strachey: recollections of his influence - Gordon (1999) (Correct)
0.2: Multi Lingual Sequent Calculus and Coherent Spaces - Jung, Kegelmann, Moshier (1997) (Correct)
0.2: Towards an infinitary logic of domains: Abramsky logic for.. - Bonsangue, Kok (Correct)
Related documents from co-citation: More All
45: A Compendium of Continuous Lattices (context) - Gierz, Hofmann et al. - 1980
21: measures and fractals via domain theory (context) - Edalat - 1995
21: LCF considered as a programming language (context) - Plotkin - 1977
BibTeX entry: (Update)
S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1--168. Clarendon Press, 1994. http://citeseer.ist.psu.edu/abramsky94domain.html More
@incollection{ abramsky94domain,
author = "Samson Abramsky and Achim Jung",
title = "Domain Theory",
booktitle = "Handbook of Logic in Computer Science Volume 3",
publisher = "Oxford University Press",
editor = "S. Abramsky and D. Gabbay and T. S. E. Maibaum",
pages = "1--168",
year = "1994",
url = "citeseer.ist.psu.edu/abramsky94domain.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
982 Theoretical Computer Science (context) - Girard - 1987 ACM
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
509 Introduction to Lattices and Order (context) - Davey, Priestley - 1990
369 Information and Computation (context) - Moggi, computations - 1991 DBLP
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
343 Introduction to Metamathematics (context) - Kleene - 1952
291 Theoretical Computer Science (context) - Gunter, power - 1992 ACM
245 A Compendium of Continuous Lattices (context) - Gierz, Hofmann et al. - 1980
214 Domains for denotational semantics (context) - Scott - 1982 ACM DBLP
214 An ideal model for recursive polymorphic types (context) - MacQueen, Plotkin et al. - 1986 ACM DBLP
194 The Formal Semantics of Programming Languages (context) - Winskel - 1993 ACM
179 The lazy lambda calculus - Abramsky - 1990 ACM
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994 ACM DBLP
173 An initial algebra approach to the specification (context) - Goguen, Thatcher et al. - 1978
163 Commentary on Standard ML (context) - Milner, Tofte - 1991 ACM
162 Data types as lattices (context) - Scott - 1976 DBLP
152 Semantics of Programming Languages (context) - Gunter - 1992 ACM
150 The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin - 1982 DBLP
146 A powerdomain construction (context) - Plotkin - 1976 ACM DBLP
139 An introduction to event structures (context) - Winskel - 1988 ACM DBLP
130 Full abstraction in the lazy lambda calculus (context) - Abramsky, Ong - 1993 ACM DBLP
125 Outline of a mathematical theory of computation (context) - Scott - 1970
117 Semantic Domains - Gunter, Scott - 1990 ACM DBLP
109 Continuous lattices (context) - Scott - 1972
97 An introduction to inductive definitions (context) - Aczel - 1977
93 A probabilistic powerdomain of evaluations (context) - Jones, Plotkin - 1989 ACM DBLP
84 A domain equation for bisimulation (context) - Abramsky - 1991 ACM DBLP
83 Powerdomains and predicate transformers: a topological view (context) - Smyth - 1983
77 Full abstraction for a simple parallel programming language (context) - Hennessy, Plotkin - 1979 DBLP
75 Annals of Pure and Applied Logic (context) - Abramsky, in - 1991
72 Journal of Computer and Systems Sciences (context) - Smyth - 1978
70 volume 6 of EATCS Monographs on Theoretical Computer Science (context) - Ehrig, Mahr et al. - 1985
70 Semantics of Programming Languages (context) - Tennent - 1991 ACM
67 Strictness analysis for higher order functions (context) - Burn, Hankin et al. - 1986
59 Using powerdomains to generalize relational databases - Buneman, Jung et al. - 1991 ACM DBLP
58 Algebraically complete categories (context) - Freyd - 1991
56 Post-graduate lecture notes in advanced domain theory (context) - Plotkin - 1981
56 A Theory of Programming Language Semantics (context) - Milne, Strachey - 1976
51 Allyn and Bacon (context) - Schmidt - 1986
50 New foundations for the geometry of interaction - Abramsky, Jagadeesan - 1994 ACM DBLP
49 A co-induction principle for recursively defined domains - Pitts - 1992 ACM DBLP
47 Fully Abstract Models of Programming Languages (context) - Stoughton - 1988 ACM
45 First steps in synthetic domain theory (context) - Hyland - 1991
45 New foundations for fixpoint computations: FIXhyperdoctrines.. (context) - Crole, Pitts - 1992
42 A Per model of polymorphism and recursive types - Abadi, Plotkin - 1990 DBLP
42 Information and Computation (context) - Robinson, Rosolini et al. - 1988 DBLP
41 Strictness analysis in logical form - Jensen - 1991 ACM DBLP
40 Fixpoint induction and proofs of program propertie (context) - Park - 1969
39 Fixed point theorems and semantics: A folk tale (context) - Lassez, Nguyen et al. - 1982 DBLP
38 Allyn and Bacon (context) - Herrlich, Strecker - 1973
38 Interaction categories and communicating sequential processe.. (context) - Abramsky - 1994 ACM
38 Lectures on a mathematical theory of computation (context) - Scott - 1981
36 Remarks on algebraically compact categories (context) - Freyd - 1992
35 Domain Theory and the Logic of Observable Properties (context) - Abramsky - 1987
34 Theoretical Computer Science (context) - Smyth, domains - 1977 ACM
33 Algebraic specification of data types: A synthetic approach (context) - Lehmann, Smyth - 1981
32 Unifying partial descriptions of sets (context) - Pollard, Moshier - 1990
32 A fully abstract denotational model for higher order process.. (context) - Hennessy - 1993
30 Relating theories of lambda calculus (context) - Scott - 1980
30 Hypercoherences: A strongly stable model of linear logic - Ehrhard - 1993 DBLP
29 Relational properties of recursively defined domains - Pitts - 1993 DBLP
29 Relational properties of recursively defined domains - Pitts - 1993 DBLP
28 The fixed point property in synthetic domain theory (context) - Taylor - 1991 DBLP
28 Continuity and Effectiveness in Topoi (context) - Rosolini - 1986
27 Stable models of typed -calculi (context) - Berry - 1978
27 volume 3 of Cambridge Studies in Advanced Mathematics (context) - Johnstone - 1982
26 Grundzuge der Mengenlehre (context) - Hausdorff - 1914
24 Cambridge Tracts in Theoretical Computer Science (context) - Vickers, Logic - 1989
24 CPO's of measures for nondeterminism (context) - Saheb-Djahromi - 1980 DBLP
24 The semantics of grammar formalisms seen as computer languag.. - Pereira, Shieber - 1984 ACM
23 The classification of continuous domains (context) - Jung - 1990
23 Centrum voor Wiskunde en Informatica (context) - Jung, Categories et al. - 1989
23 Bulletin of the American Mathematical Society (context) - Johnstone, of - 1983
23 Monads on symmetric monoidal closed categories (context) - Kock - 1970
23 Nondeterminism in a functional setting (context) - Ong - 1993
23 Progress in Theoretical Computer Science (context) - Curien, Sequential et al. - 1993
22 dI-domains as a model of polymorphism (context) - Coquand, Gunter et al. - 1987 ACM DBLP
21 logical relations and Kan extensions (context) - Abramsky - 1990
21 A semantics for complex objects and approximate queries - Buneman, Davidson et al. - 1988 ACM DBLP
21 Extensional PERs (context) - Freyd, Mulry et al. - 1990 ACM DBLP
21 The largest cartesian closed category of domains (context) - Smyth - 1983 DBLP
21 A note on inconsistencies caused by fixpoints in a cartesian.. (context) - Huwig, Poign'e - 1990 ACM DBLP
20 Type theory and recursion (context) - Plotkin - 1993
19 Atomless parts of spaces (context) - Isbell - 1972
19 Notes for a course given at the Center for the Study of Lang.. (context) - Plotkin, predomains et al. - 1985
19 Local compactness and continuous lattices (context) - Hofmann, Mislove - 1981
18 Synthetic Differential Geometry (context) - Kock - 1981
17 Domain Theory in Realizability Toposes (context) - Phoa - 1991
17 Indexed category Theory and Polymorphism (context) - Taylor - 1987
17 Power Domain Constructions - Heckmann - 1990 ACM DBLP
17 Disjunctive strictness analysis (context) - Jensen - 1992 DBLP
16 Archiv der Mathematik (context) - Kock, monoidal - 1972
16 of variable types: Fifteen years later (context) - Girard - 1986
15 Power domains and second order predicates - Heckmann - 1993
15 Technical Report (context) - Kahn, Plotkin - 1978
14 Information and Computation (context) - Hrbacek - 1987 DBLP
14 Information and Computation (context) - Hrbacek - 1989 DBLP
13 Science of Computer Programming (context) - Heckmann, constructions - 1991
13 Algebra and Logic (context) - Ershov, of et al. - 1975
13 A generalized Kahn principle for abstract asynchronous netwo.. (context) - Abramsky - 1990 ACM DBLP
13 Domain theory and integration - Edalat - 1993 ACM DBLP
12 To appear in Information and Computation (context) - Boudol, for et al. - 1991
12 A direct proof of the Hofmann-Mislove theorem (context) - Keimel, Paseka
12 The duality of continuous posets (context) - Lawson - 1979
11 The lattice of flow diagrams (context) - Scott - 1971
11 Two families of languages related to ALGOL (context) - Ginsburg, Rice - 1962 ACM DBLP
11 The snack powerdomain for database semantics (context) - Puhlmann - 1993 ACM DBLP
11 Basic category theory (context) - Poign'e - 1992 ACM
11 Domain theory meets default logic - Rounds, Zhang - 1994 DBLP
11 Progress in Theoretical Computer Science (context) - Zhang, Domains - 1991
10 A subdirect-union representation for completely distributive.. (context) - Raney - 1953
10 Coherence and consistency in domains - Gunter, Jung - 1988
10 Algebras for Generalized Power Constructions (context) - Schalk - 1993
10 Retraction dI domain as model typetype (context) - Retractions, as et al. - 1991
9 categories as a framework for solving domain equations - Edalat, Smyth - 1993
9 Free constructions of powerdomains (context) - Main - 1985 ACM DBLP
8 Tight Galois connections and complete distributivity (context) - Raney - 1960
8 Realizability and Recursive Mathematics (context) - McCarty - 1984
8 Kluwer Academic Publishers (context) - Ad'amek, Trnkov'a et al. - 1989
8 Also published as Technical Report No (context) - Jones, PhD et al. - 1990
7 Non-stable models of linear logic (context) - Hoofman - 1992 ACM DBLP
7 Rheinisch-Westfalische Technische Hochschule Aachen (context) - Weihrauch, Deil et al. - 1980
6 Scott is not always sober (context) - Johnstone - 1981
6 An algebraic approach to stable domains (context) - Taylor - 1990
6 Universal information systems (context) - Droste, Gobel - 1991
5 Finite approximation of spaces (context) - Smyth - 1986 ACM DBLP
5 prime spectra of completely distributive complete lattices (context) - Hoffmann - 1981
5 Powerdomains and modality (context) - Winskel - 1983
5 Fully effective solutions of recursive domain equations (context) - Kanda - 1979 DBLP
5 Linear domains and linear maps (context) - Huth - 1994 ACM DBLP
5 A type theoretic alternative to ISWIM (context) - Scott - 1969
5 New results on hierarchies of domains (context) - Jung - 1988 ACM DBLP
5 Theoretical Computer Science (context) - Coquand, embeddings - 1989 ACM
5 Closure properties of a probabilistic powerdomain constructi.. (context) - Graham - 1988
4 The characterization of congruence lattices of lattices (context) - Tischendorf, Tuma - 1993
4 A motivation and generalization of Scott's notion of a conti.. (context) - Markowsky - 1981
4 measures and fractals via domain theory: extended abstract (context) - Edalat - 1993
4 eles Compl`ement Ad (context) - Berry - 1979
4 Monatshefte fur Mathematik und Physik (context) - Vietoris, Ordnung - 1922
4 sets and directed sets with applications (context) - Markowsky - 1976
4 Monatshefte fur Mathematik und Physik (context) - Vietoris - 1921
4 On order-complete universal algebra and enriched functorial .. (context) - Meseguer - 1977 DBLP
4 All compact Hausdorff lambda models are degenerate - Hofmann, Mislove - 1993 DBLP
4 Complete lattices and the generalized Cantor theorem (context) - Davies, Hayes et al. - 1971
4 Universal domains in the theory of denotational semantics of.. (context) - Droste, Gobel - 1990
4 Observable modules and power domain constructions - Heckmann - 1993 ACM
4 The largest first-order axiomatizable cartesian closed categ.. (context) - Gunter - 1986
4 continuous algebras (context) - Nelson - 1981
3 Towards a mathematical theory of programs (context) - Bekic - 1971
3 do not form a continuous lattice -- a solution to Scott's pr.. (context) - Hosono, Sato et al. - 1977
3 New foundations for recursion theory (context) - Platek - 1964
3 A powerdomain construction (context) - Hrbacek - 1988 ACM DBLP
3 Cartesian closed categories of domains and the space Proj (context) - Huth - 1992
3 Completion of a construction of Johnstone (context) - Isbell - 1982
3 Zenkoku Shijo Sugaku Danwakai (context) - Iwamura, on et al. - 1944
3 Categories of chain-complete posets (context) - Markowsky - 1977 DBLP
3 Colimits in the category CPO (context) - Fiech - 1992
3 Algebraic Methods in Computer Science (context) - Nivat, Reynolds - 1985
3 Mathematical Structures in Computer Science (context) - Droste, Gobel et al. - 1993
3 chapter Delayed logic and finite state machines (context) - Arden, Computing - 1960
3 A relational approach to strictness analysis for polymorphic.. (context) - Abramsky, Jensen - 1991
2 Posets isomorphic to their extensions (context) - Ern'e - 1985
2 Tree constructions of free continuous algebras (context) - Ad'amek, Nelson et al. - 1982 DBLP
2 Ordnungstheoretische Modelle fur nicht-deterministische Prog.. (context) - NuBetaler - 1992
2 Un type d'ensembles semi-ordon'es et ses rapports avec une h.. (context) - Krasner - 1939
2 A theory of programs (context) - de Bakker, Scott - 1969
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.bham.ac.uk/~axj/papers.html): More
A New Characterization of Lambda Definability - Jung, Tiuryn (1993) (Correct)
The Classification of Continuous Domains (Extended Abstract) - Jung (Correct)
Uniform Approximation of Topological Spaces - Jung, Sünderhauf (1996) (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