Marcelo P. Fiore  Home/Search
Context
Related
| cogs.susx.ac.uk/users/marcelo...axdt.ps 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: cogs.susx.ac.uk/users/marce...ADT (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The denotational semantics approach to the semantics of programming languages interprets the language constructions by assigning elements of mathematical structures to them. The structures form so-called categories of domains and the study of their closure properties is the subject of domain theory [Sco70, Sco82, Plo83, GS90, AJ94]. Typically, categories of domains consist of suitably complete partially ordered sets together with continuous maps. But, what is a category of domains? The main aim ... (Update)
Active bibliography (related documents): More All
2.6: Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (Correct)
0.6: Developing Theories of Types and Computability - Birkedal (1998) (Correct)
0.6: An Axiomatisation of Computationally Adequate Domain.. - Fiore, Plotkin (1994) (Correct)
Similar documents based on text: More All
0.5: Computational Adequacy for Recursive Types in Models of.. - Simpson (2002) (Correct)
0.4: An Extension of Models of Axiomatic Domain Theory to Models.. - Fiore, Plotkin (1997) (Correct)
0.3: Complete Cuboidal Sets in Axiomatic Domain Theory (Extended.. - Fiore, al. (1997) (Correct)
BibTeX entry: (Update)
@article{ fiore96axiomatic,
author = "Fiore",
title = "Axiomatic Domain Theory",
journal = "BEATCS: Bulletin of the European Association for Theoretical Computer Science",
volume = "59",
year = "1996",
url = "citeseer.ist.psu.edu/fiore95axiomatic.html" }
Citations (may not include all citations):505 Implementing Mathematics with the NuPrl Proof Development Sy.. - Constable - 1986
434 A framework for defining logics - Harper, Honsell et al. - 1992
369 Information and Computation (context) - Moggi, computation - 1991
359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
306 LCF considered as a programming language (context) - Plotkin - 1977
266 Information and Computation (context) - Coquand, Huet et al. - 1988
224 Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
214 Domains for denotational semantics (context) - Scott - 1982
162 Data types as lattices (context) - Scott - 1976
150 The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin - 1982
144 Full abstraction for PCF - Abramsky, Malacaria - 1994
126 Cambridge University Press (context) - Johnstone - 1982
125 Outline of a mathematical theory of computation (context) - Scott - 1970
109 Continuous lattices (context) - Scott - 1972
77 Full abstraction for a simple parallel programming language (context) - Henessy, Plotkin - 1979
72 The Formal Semantics of Programming Languages: An Introducti.. (context) - Winskel - 1993
72 The Theory of LEGO: A Proof Checker for the Extended Calculu.. - Pollack - 1995
59 Axiomatic Domain Theory in Categories of Partial Maps (context) - Fiore - 1994
58 Algebraically complete categories (context) - Freyd - 1991
49 A co-induction principle for recursively defined domains - Pitts - 1994
46 Recursive types reduced to inductive types (context) - Freyd, Mulry et al. - 1990
46 Recursive types reduced to inductive types (context) - Freyd - 1990
45 New foundations for fixpoint computations: FIX-hyperdoctrine.. (context) - Crole, Pitts - 1992
45 First steps in synthetic domain theory (context) - Hyland - 1991
42 A per model of polymorphism and recursive types - Abadi, Plotkin - 1990
42 Information and Computation (context) - Robinson, Rosolini et al. - 1988
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
35 Domain Theory and the Logic of Observable Properties (context) - Abramsky - 1987
34 Theoretical Computer Science (context) - Smyth, domains - 1977
34 Semantical paradigms: Notes for an invited lecture (context) - Meyer, Cosmadakis - 1988
33 Domain theoretic models of polymorphism - Coquand, Gunter et al. - 1989
33 Algebraic specification of data types: A synthetic approach (context) - Lehmann, Smyth - 1981
31 Department of Computer Science (context) - Plotkin - 1983
29 A short description of Another Logical Framework (context) - Augustsson, Coquand et al. - 1990
28 Continuity and Effectiveness in Topoi (context) - Rosolini - 1986
28 The fixed point property in synthetic domain theory (context) - Taylor - 1991
26 Realizability Toposes and Language Semantics (context) - Longley - 1995
25 A type-theoretical alternative to CUCH (context) - Scott - 1993
25 Recursive types in Kleisli categories - Simpson - 1992
25 A type-theoretical alternative to CUCH (context) - Scott - 1969
24 Denotational semantics with partial functions (context) - Plotkin - 1985
23 eles Compl`etement Ad (context) - Berry - 1979
23 An axiomatisation of computationally adequate domain-theoret.. - Fiore, Plotkin - 1994
23 Games and full abstraction for the lazy -calculus (context) - Abramsky, McCusker - 1995
21 A note on inconsistencies caused by fixpoints in a cartesian.. (context) - Huwig, Poign'e - 1990
20 Type theory and recursion (context) - Plotkin - 1993
17 Program verification in synthetic domain theory - Reus - 1995
17 Domain Theory in Realizability Toposes (context) - Phoa - 1990
17 Linear lambda calculus and categorical models revisited - Benton, Bierman et al. - 1993
15 Logic of Domains (context) - Zhang - 1991
15 An elementary theory of the category of sets (context) - Lawvere - 1964
12 Fixed point constructions in order-enriched categories (context) - Wand - 1979
10 Algebraic completeness and compactness in an enriched settin.. (context) - Plotkin - 1995
10 Generalized banach-mazur functionals in the topos of recursi.. (context) - Mulry - 1981
10 categories and duality (context) - Smyth - 1992
9 Algebraically compact functors (context) - Barr - 1992
9 Diagonal arguments and cartesian closed categories (context) - Lawvere - 1969
9 Handbook of Theoretical Computer Science (context) - Gunter, Scott - 1990
8 Induction and coinduction via subset types and quotient type.. (context) - Hermida, Jacobs - 1995
7 Logical aspects of denotational semantics (context) - Robinson - 1987
6 Notes on synthetic domain theory (context) - Rosolini - 1995
5 Cartesian closed categories of enumerations for effective ty.. (context) - Longo, Moggi - 1984
5 School of Computer Science (context) - Fiore, Jung et al. - 1996
4 A general adequacy result for a linear functional language (context) - Brauner - 1994
4 volume 1488 of Lecture Notes in Mathematics (context) - Carboni, Pedicchio et al. - 1991
4 Relational properties of recursively defined datatypes (context) - Pitts - 1993
4 To appear in the Handbook of Logic in Computer Science (context) - Abramsky, Jung - 1994
3 Volume 5 of Tracts in Theoretical Computer Science (context) - Vickers, Logic et al. - 1989
2 Naive synthetic domain theory (context) - Reus, Streicher - 1994
1 volume 177 of London Mathematical Society Lecture Note Serie.. (context) - Fourman, Johnstone et al. - 1992
1 available from httptheory (context) - Metalanguages, available et al. - 1995
1 A survey of the project AUTOMATH (context) - de Brujin - 1980
1 available from httptheory (context) - Hyland, full et al. - 1995
1 The domain interpretation of type theory (context) - Martin-Lof - 1983
1 Manuscript available from httpwww (context) - First, the et al. - 1994
1 Also CMU-CS (context) - McCarty, Recursive et al. - 1984
1 To appear in Information and Computation (context) - Ad'amek, in et al. - 1993
Documents on the same site (http://www.cogs.susx.ac.uk/users/marcelo/papers/ADT/ADT.html): More
Complete Cuboidal Sets in Axiomatic Domain Theory (Extended.. - Fiore, al. (1997) (Correct)
An Enrichment Theorem for an Axiomatisation of Categories of.. - Fiore (1996) (Correct)
An Axiomatisation of Computationally Adequate Domain.. - Fiore, Plotkin (1994) (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