Hanno Nickau  Home/Search
Context Related
| informatik.unisiegen.de...lfcs94.ps.gz web.comlab.ox.ac.uk/oucl...lfcs94.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: informatik.unisiegen.de/~nick... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In order to define models of simply typed functional programming languages being closer to the operational semantics of these languages, the notions of sequentiality, stability and seriality were introduced. These works originated from the definability problem for PCF, posed in [Sco72], and the full abstraction problem for PCF, raised in [Plo77]. The presented computation model, forming the class of hereditarily sequential functionals, is based on a game in which each play describes the... (Update)
Cited by: More
Full Abstraction for PCF - Samson Abramsky Radha (1994) (Correct)
Sequential Algorithms and Strongly Stable Functions - Mellies (Correct)
Asynchronous Games 2 - The true concurrency of innocence - Mellies (2004) (Correct)
Similar documents (at the sentence level):
30.6%: Hereditarily Sequential Functionals: A Game-Theoretic Approach to .. - Nickau (1996) (Correct)
Active bibliography (related documents): More All
0.8: Correspondence between operational and denotational semantics: the.. - Ong (1995) (Correct)
0.5: Density and Choice for Total Continuous Functionals - Schwichtenberg (1996) (Correct)
0.5: Finite Notations for Infinite Terms - Schwichtenberg (1998) (Correct)
Similar documents based on text: More All
0.5: Notions of computability at higher types II - Longley (2001) (Correct)
0.4: Computability Over the Partial Continuous Functionals - Normann (1998) (Correct)
0.3: Notions of computability at higher types I - Longley (2001) (Correct)
Related documents from co-citation: More All
34: Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
29: LCF considered as a programming language (context) - Plotkin - 1977
24: Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
BibTeX entry: (Update)
H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, Lecture notes in Computer Science. Springer, 1994. http://citeseer.ist.psu.edu/nickau94hereditarily.html More
@inproceedings{ nickau94hereditarily,
author = "H. Nickau",
title = "Hereditarily Sequential Functionals",
booktitle = "Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St.\ Petersburg",
publisher = "Springer",
year = "1994",
url = "citeseer.ist.psu.edu/nickau94hereditarily.html" }
Citations (may not include all citations):306 LCF considered as a programming language (context) - Plotkin - 1977
109 Continuous lattices (context) - Scott - 1972
66 Fully abstract models of typed -calculi (context) - Milner - 1977
61 Sequential algorithms on concrete data structures (context) - Berry, Curien - 1982
49 Recursive functionals and quantifiers of finite types (context) - Kleene - 1959
49 Recursive functionals and quantifiers of finite types revisi.. (context) - Kleene - 1978
29 Theory and practice of sequential algorithms: the kernel of .. (context) - Berry, Curien - 1985
22 Foundations of Recursion Theory (context) - Platek - 1966
18 Observable sequentiality and full abstraction - Cartwright, Felleisen - 1992
17 Characterizations of the basic feasible functionals of finit.. - Cook, Kapron - 1990
15 Theoretical Computer Science (context) - Weihrauch, recursion - 1985
15 Logic of Domains (context) - Zhang - 1991
9 Observable algorithms on concrete data structures (context) - Curien - 1992
8 Information and Computation (context) - Curien - 1986
6 Sequential Models of PCF: Some Contributions to the DomainTh.. (context) - Bucciarelli - 1993
6 Structures de donn'ees concr`etes (context) - Kahn, Plotkin - 1978
5 Scott's LCF language (context) - Yu, of et al. - 1976
2 Zeitschrift fur mathematische Logik und Grundlagen der Mathe.. (context) - Ershov - 1975
2 Computable functionals of finite type (context) - Gandy - 1967
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-siegen.de/~nickau/): More
More Universal Game Models of Untyped λ-Calculus: The .. - Ker, Nickau, Ong (1999) (Correct)
Games Models of Untyped lambda-Calculus - Ker, Nickau, Ong (1998) (Correct)
Degrees of Parallelism - Lichtenthäler (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