Allen Stoughton  Home/Search
Context Related
| ksu.edu/pub/CIS/Stoughton/ppcf.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: ksu.edu/~schmidt/group.survey (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that the continuous function model is the unique extensional (but not necessarily pointwise ordered) model of the variant of the applied typed lambda calculus PCF that includes the "parallel or" operation. 1 Introduction Several extensional models of the applied typed lambda calculus PCF are known to exist, including: (i) The continuous function model, which is order-extensional (pointwise ordered) but not equationally fully abstract [Plo]. (A model is equationally fully abstract when... (Update)
Cited by: More
Correspondence between operational and denotational semantics: the.. - Ong (1995) (Correct)
Active bibliography (related documents): More All
0.4: Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (Correct)
0.3: Full Abstraction and Expressive Completeness for FP - Halpern, Wimmers (Correct)
0.1: Full Abstraction, Totality and PCF - Plotkin (1997) (Correct)
Similar documents based on text: More All
0.2: Full Abstraction for PCF (Extended Abstract) - Abramsky, Malacaria, Jagadeesan (Correct)
0.2: Partial Higher-Order Specifications - Astesiano, Cerioli (1992) (Correct)
0.2: Operational and Axiomatic Semantics of PCF - Howard, Mitchell (1990) (Correct)
Related documents from co-citation: More All
6: Recursive Functionals and Quantifiers of Finite Types Revisited II (context) - Kleene - 1978
2: A type theoretical alternative to CUCH (context) - Scott - 1993
2: Theoretical Computer Science (context) - Girard - 1987
BibTeX entry: (Update)
A. Stoughton. Parallel PCF has a unique extensional model. In Proc. 6th IEEE Annual Symp. Logic in Computer Science, pages 146--151. IEEE Computer Society Press, 1991. http://citeseer.ist.psu.edu/stoughton91parallel.html More
@inproceedings{ stoughton91parallel,
author = "Allen Stoughton",
title = "Parallel {PCF} Has a Unique Extensional Model",
booktitle = "Logic in Computer Science",
pages = "146-151",
year = "1991",
url = "citeseer.ist.psu.edu/stoughton91parallel.html" }
Citations (may not include all citations):306 LCF considered as a programming language (context) - Plotkin - 1977
66 Fully abstract models of typed -calculi (context) - Milner - 1977
47 Fully Abstract Models of Programming Languages (context) - Stoughton - 1988
38 Full abstraction for sequential languages: the state of the .. (context) - Berry, Curien et al. - 1985
23 eles Compl`etement Ad (context) - Berry - 1979
10 Interdefinability of parallel operations in PCF (context) - Stoughton - 1991
4 Equationally fully abstract models of PCF (context) - Stoughton - 1990
Documents on the same site (http://www.cis.ksu.edu/~schmidt/group.survey.html): More
Implementation of Intuitionistic Type Theory and Realizability .. - Yuki Komagata (1995) (Correct)
CPS Transformation after Strictness Analysis - Danvy, Hatcliff (1993) (Correct)
Stackability in the Simply-Typed Call-By-Value Lambda Calculus - Banerjee, Schmidt (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