Gordon Plotkin  Home/Search
Context
Related
| dcs.ed.ac.uk/home/gdp/publi...TIM.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: dcs.ed.ac.uk/home/gdp/publ...pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we interest ourselves in counterexamples in order to make a case that these natural avenues of research had a degree of necessity. To this end, we construct inadequate models and investigate whether one can do better than the standard model, but still stay in the category of complete partial orders. (In contrast, an inadequate standard model of PCF is given in [Sim99]---but in a specially constructed category.) We consider just one example, an untyped call-by-name #-calculus (Update)
Active bibliography (related documents): More All
0.3: Semantic Techniques for Deriving Coinductive Characterizations of .. - Lenisa (1997) (Correct)
0.3: Full Abstraction, Totality and PCF - Plotkin (1997) (Correct)
0.3: Behavioural Theories - Bidoit, Hennicker (1995) (Correct)
Similar documents based on text: More All
0.1: Parallel PCF has a Unique Extensional Model - Stoughton (1991) (Correct)
0.1: Similarity Between The Sequences Of Taxol-Selected Peptides.. - Rodi, Makowski (Correct)
0.1: Degrees of Parallelism - Lichtenthäler (1996) (Correct)
BibTeX entry: (Update)
@misc{ plotkin-three,
author = "Gordon Plotkin",
title = "Three Inadequate Models",
url = "citeseer.ist.psu.edu/372515.html" }
Citations (may not include all citations):306 LCF Considered as a Programming Language (context) - Plotkin - 1977
179 The Lazy Lambda Calculus - Abramsky - 1990
150 The Category-Theoretic Solution of Recursive Domain Equation.. (context) - Smyth, Plotkin - 1982
130 Full Abstraction in the Lazy Lambda Calculus (context) - Abramsky, Ong - 1993
69 Relational Properties of Domains - Pitts - 1996
59 Axiomatic Domain Theory in Categories of Partial Maps (context) - Fiore - 1985
58 Algebraically Complete Categories (context) - Freyd - 1991
44 Event Structures and Domains (context) - Nielsen, Plotkin et al. - 1981
38 Full Abstraction for Sequential Languages: the State of the .. (context) - Berry, Curien et al. - 1985
31 Structural Induction and Coinduction in a Fibrational Settin.. - Hermida, Jacobs - 1998
23 An Axiomatisation of Computationally Adequate Domain-Theoret.. - Fiore, Plotkin - 1994
22 Weak Bisimulation and Open Maps - Fiore, Cattani et al. - 1999
21 Reasoning about Sequential Functions via Logical Relations (context) - Sieber - 1992
18 Iteration Theories: The Equational Logic of Iterative Proces.. (context) - Bloom, Esik - 1993
17 Types and Models (context) - Krivine - 1993
15 Cambridge Tracts in Theoretical Computer Science (context) - Amadio, Curien et al. - 1998
13 From Computation to Foundations via Functions and Applicatio.. (context) - Berline - 2000
12 Computational Adequacy in an Elementary Topos - Simpson - 1999
11 Amsterdam: North-Holland (context) - Barendregt, Calculus - 1984
11 Computational Adequacy via `Mixed' Inductive Definitions - Pitts - 1994
10 Interdefinability of Parallel Operations in PCF (context) - Stoughton - 1991
7 Combinator in Scott's Lambda-Calculus Models (context) - Park, Y- - 1976
7 Logical Full Abstraction and PCF - Longley, Plotkin - 1998
6 Logical Predicates and Indeterminates (context) - Hermida - 1993
4 A Note on Logical Relations Between Semantics and Syntax - Pitts - 1997
3 Fully Abstract Models of Typed #-calculi (context) - Milner - 1977
1 Dipartimento di Matematica e Informatica (context) - Di Gianantonio, Franco et al. - 1999
1 Game Semantics for Untyped ###-Calculus (context) - Di Gianantonio, Franco et al. - 1999
1 Bulletin of the European Association for Th (context) - Fiore, Jung et al. - 1996
1 Set-Theoretical and Other Elementary Models of the #- Calcul.. (context) - Plotkin - 1993
Documents on the same site (http://www.dcs.ed.ac.uk/home/gdp/publications/pubs.html): More
An Axiomatisation of Computationally Adequate Domain.. - Fiore, Plotkin (1994) (Correct)
Uncountable Limits and the Lambda Calculus - Di GIANANTONIO, al. (1995) (Correct)
On a Question of Friedman - Plotkin (1995) (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