See this document in CiteSeerX!

A Combinatory Algebra for Sequential Functionals of Finite Type (1997)  (Make Corrections)  (9 citations)
Jaap van Oosten
Models and Computability



  Home/Search   Context   Related

 
View or download:
math.ruu.nl/publications/pr...996.ps.gz
math.uu.nl/publications/pre...996.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  math.ruu.nl/publications/Prepr... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: It is shown that the type structure of finite-type functionals associated to a combinatory algebra of partial functions from IN to IN (in the same way as the type structure of the countable functionals is associated to the partial combinatory algebra of total functions from IN to IN), is isomorphic to the type structure generated by object N (the flat domain on the natural numbers) in Ehrhard's category of "dI-domains with coherence", or his "hypercoherences". AMS Subject Classification:... (Update)

Context of citations to this paper:   More

...PCF is the extensional collapse of the sequential algorithm model. J. van Oosten and J.R. Longley proved recently similar results [vO97, Lon98] in a realizability setting where realizers are deterministic strategies encoded as partial functions from the set of natural numbers...

.... termination test on Sigma rules out models of SDT based on sequential partial combinatory algebras (such as, e.g. the ones considered in [17], 14] and [15] 4] gives a non realizability model 18 where nonetheless Axiom 4 fails) and inasmuch one is interested in...

Cited by:   More
The Combinatory Algebras - And Wb Are   (Correct)
On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002)   (Correct)
Games on Graphs and Sequentially Realizable Functionals - Exte Nd Ed   (Correct)

Active bibliography (related documents):   More   All
0.6:   Correspondence between operational and denotational semantics: the.. - Ong (1995)   (Correct)
0.3:   Game Semantics - Abramsky, McCusker (1999)   (Correct)
0.1:   Proof Mining in Subsystems of Analysis - Oliva (2003)   (Correct)

Similar documents based on text:   More   All
0.5:   Parallel and Serial Hypercoherences - Ehrhard (1995)   (Correct)
0.4:   A Partial Analysis of Modified Realizability - Jaap Van Oosten   (Correct)
0.4:   Realizability: A Historical Essay - van Oosten (2000)   (Correct)

Related documents from co-citation:   More   All
5:   to appear in Annals of Pure and Applied Logic (context) - Longley, realizable et al. - 1998
4:   Characterizations of the basic feasible functions of finite type (context) - Cook, Kapron - 1990
4:   Functional interpretations of feasibly constructive arithmetic (context) - Cook, Urquhart - 1989

BibTeX entry:   (Update)

J. van Oosten. A combinatory algebra for sequential functionals of finite type. Technical Report 996, University of Utrecht, 1997. http://citeseer.ist.psu.edu/vanoosten97combinatory.html   More

@inproceedings{ vanoosten99combinatory,
    author = "J. van Oosten",
    title = "A Combinatory Algebra for Sequential Functionals of Finite Type",
    booktitle = "Models and Computability",
    publisher = "Cambridge University Press",
    editor = "S. B. Cooper and J. K. Truss",
    pages = "389--406",
    year = "1999",
    url = "citeseer.ist.psu.edu/vanoosten97combinatory.html" }
Citations (may not include all citations):
982   Theoretical Computer Science (context) - Girard, System et al. - 1986
306   LCF considered as a programming language (context) - Plotkin - 1977
144   Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
49   Recursive Functionals and Quantifiers of Finite Type Revisit.. (context) - Kleene - 1978
49   Recursive Functionals and Quantifiers of Finite Type Revisit.. (context) - Kleene - 1980
49   Recursive Functionals and Quantifiers of Finite Type (context) - Kleene - 1959
49   Recursive Functionals and Quantifiers of Finite Type II (context) - Kleene - 1963
45   First Steps in Synthetic Domain Theory (context) - Hyland - 1991
39   The Effective Topos (context) - Hyland - 1982
26   Tripos Theory (context) - Hyland, Johnstone et al. - 1980
19   Sequentiality and strong stability (context) - Bucciarelli, Ehrhard - 1991
16   Projecting sequential algorithms on strongly stable function.. - Ehrhard - 1996
11   The Foundations of Intuitionistic Mathematics (context) - Kleene, Vesley - 1965
1   Recursion on the Countable Functionals (context) - Norman - 1980
1   A relative PCF-definability result (context) - Ehrhard - 1996
1   typeset manuscript (context) - Hyland, Ong et al. - 1994
1   A New Category (context) - Scott - 1996



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.math.ruu.nl/publications/Preprints/):   More
On Equilibria in Continuum Games - Balder (1997)   (Correct)
Cyclic Cohomology of Étale Groupoids; The General Case - Crainic   (Correct)
A Metaphor For Adiabatic Evolution To Symmetry - Huveneers, Verhulst (1997)   (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