Gordon Plotkin  Home/Search
Context Related
| homepages.inf.ed.ac.uk/gd...Totality.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: homepages.inf.ed.ac.uk/gdp/pub... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, asking whether full abstraction holds for Scott's model of cpos and continuous functions if one restricts to total programs and total observations. (Update)
Similar documents based on text: More All
1.1: Full Abstraction, Totality and PCF - Plotkin (1997) (Correct)
0.2: Logical Full Abstraction and PCF - Longley, Plotkin (1996) (Correct)
0.1: Kripke Logical Relations and PCF - O'Hearn, Riecke (1995) (Correct)
BibTeX entry: (Update)
G. Plotkin, "Full Abstraction, Totality and PCF", available by ftp at ftp://ftp.lfcs.ed.ac.uk/pub/gdp/ as Totality.ps.gz, 1997. This article was processed using the L A T E X macro package with LLNCS style http://citeseer.ist.psu.edu/plotkin97full.html More
@misc{ plotkin97full,
author = "G. Plotkin",
title = "Full Abstraction, Totality and PCF",
text = "G. Plotkin, Full Abstraction, Totality and PCF, available by ftp at ftp://ftp.lfcs.ed.ac.uk/pub/gdp/
as Totality.ps.gz, 1997. This article was processed using the L A T E X
macro package with LLNCS style",
year = "1997",
url = "citeseer.ist.psu.edu/plotkin97full.html" }
Citations (may not include all citations):229 Foundations for Programming Languages (context) - Mitchell - 1996
211 Domain Theory - Abramsky, Jung - 1994
68 On Full Abstraction for PCF (context) - Hyland, Ong - 1994
66 Fully Abstract Models of Typed -calculi (context) - Milner - 1977
38 Full Abstraction for Sequential Languages: the State of the .. (context) - Berry, Curien et al. - 1985
21 Logical Relations and Kan Extensions (context) - Abramsky, Interpretation - 1990
19 A New Characterization of Type-2 Feasibility - Kapron, Cook - 1996
14 Hereditarily Sequential Functionals: A Game-Theoretic Approa.. - Nickau - 1996
11 Equational Theories for Inductive Types - Loader - 1997
11 Computability and Complexity of Higher Type Functions (context) - Cook - 1989
11 Amsterdam: North-Holland (context) - Barendregt, Calculus - 1984
10 Categories of Domains with Totality - Normann - 1997
10 Computable and Recursively Countable Functions of Higher Typ.. (context) - Gandy, Hyland - 1977
10 of Partial Continuous Functionals (context) - Ershov - 1977
8 Continuous Functionals of Dependent and Transfinite Types - Berger - 1997
[Article contains additional citations not shown here]
Documents on the same site (http://homepages.inf.ed.ac.uk/gdp/publications/): More
Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993) (Correct)
Complete Axioms for Categorical Fixed-point Operators - Simpson, Plotkin (2000) (Correct)
Concrete Domains - Kahn, Plotkin (1993) (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