Hanno Nickau  Home/Search
Context Related
| informatik.unisiegen.de...diss96.ps.gz web.comlab.ox.ac.uk/oucl...diss96.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/...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The aim of this thesis is to give a new understanding of sequential computations in higher types. We present a new computation model for higher types based on a game describing the interaction between a functional and its arguments. The functionals which may be described in this way are called hereditarily sequential. We show that this computation model captures exactly the notion of computability in higher types introduced by Kleene in his pioneering work starting 1959. We study the order... (Update)
Context of citations to this paper: More
...calculus, using the techniques of game semantics. The strategies used are innocent in the sense of Hyland and Ong [9] and Nickau [17], but the traditional distinction between question and answer moves is removed. We rst construct models D and DREC as global sections...
.... in 1993 to the development of intensional game theoretical models in the semantics of programming languages independently by [AbrJagMal94, HylOng1, Ni96]. These models proved to be very useful and provided e.g. a solution for the probably best known open problem in the...
Cited by: More
Full Abstraction, Totality and PCF - Plotkin (1997) (Correct)
Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
A Universal Innocent Game Model For The Böhm Tree Lambda Theory - Ker, Nickau, Ong (Correct)
Similar documents (at the sentence level):
7.7%: Hereditarily Sequential Functionals - Nickau (1994) (Correct)
Active bibliography (related documents): More All
0.0: The Algebra of - Finite State Processes (Correct)
0.0: A New Characterization of Lambda Definability - Jung, Tiuryn (1993) (Correct)
0.0: On Statman's Finite Completeness Theorem - Richard Statman Gilles (1992) (Correct)
Similar documents based on text: More All
0.4: Notions of computability at higher types II - Longley (2001) (Correct)
0.4: Exact Real Number Computations Relative to Hereditary Total.. - Normann (2000) (Correct)
0.4: Notions of computability at higher types I - Longley (2001) (Correct)
Related documents from co-citation: More All
9: Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
8: On full abstraction for PCF (context) - Hyland, Ong - 1996
7: Games and Full Abstraction for a Functional Metalanguage with Recursive Types (context) - McCusker - 1998
BibTeX entry: (Update)
Hanno Nickau. Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality. Shaker-Verlag, 1996. Dissertation, Universitat Gesamthochschule Siegen. http://citeseer.ist.psu.edu/nickau96hereditarily.html More
@misc{ nickau96hereditarily,
author = "H. Nickau",
title = "Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality",
text = "Hanno Nickau. Hereditarily Sequential Functionals: A Game-Theoretic Approach
to Sequentiality. Shaker-Verlag, 1996. Dissertation, Universitat Gesamthochschule
Siegen.",
year = "1996",
url = "citeseer.ist.psu.edu/nickau96hereditarily.html" }
Citations (may not include all citations):15 Theoretical Computer Science (context) - recursion - 1985
1 Mechanizing logical relations (context) - relations, Foundations et al. - 1994
1 On representation of sequential and parallel functions (context) - sequential, In et al. - 1975
1 Effectively given domains (context) - domains, Science - 1977
1 Correct and optimal implementation of recursion in a simple .. (context) - optimal, recursion et al. - 1974
1 Second order definability via enumerations (context) - definability, Zeitschrift et al. - 1991
1 Logical relations and the typed lambda-calculus (context) - relations, lambda et al. - 1985
1 Recursion and complexity theory on CPO-s (context) - complexity, CPO et al. - 1981
1 Some models of Scott's theory LCF based on a notion of rate .. (context) - of, LCF et al. - 1990
1 Logic of Domains (context) - Domains - 1991
1 Fully Abstract Models of Programming Languages (context) - Models, Languages et al. - 1988
1 Equationally fully abstract models of PCF (context) - abstract, PCF et al. - 1990
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/index.html): More
More Universal Game Models of Untyped λ-Calculus: The .. - Ker, Nickau, Ong (1999) (Correct)
Hereditarily Sequential Functionals - Nickau (1994) (Correct)
Games Models of Untyped lambda-Calculus - Ker, Nickau, Ong (1998) (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