A Relative PCF-Definability Result for Strongly Stable Functions and some Corollaries - Semantic Scholar

Abstract

Sorry, we couldn't extract an abstract for this paper.

DOI: 10.1006/inco.1998.2781

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Cited By

Sort by:

Sequential algorithms and strongly stable functions

Paul-André Melliès
Theor. Comput. Sci.
2005

Comparing hierarchies of types in models of linear logic

Paul-André Melliès
Inf. Comput.
2004

The sequentially realizable functionals

John Longley
Ann. Pure Appl. Logic
2002

Realizability Models for Sequential Computation

John Longley
1998

Non uniform (hyper/multi)coherence spaces

Pierre Boudes
Mathematical Structures in Computer Science
2011

Notions of computability at higher types I

John Longley
2005

1 Mathematics of Games ( Continuation Report ) Robin Houston

Robin Houston
2004

Asynchronous Games 2: The True Concurrency of Innocence

Projecting Games on Hypercoherences

Pierre Boudes
ICALP
2004

Games on Graphs and Sequentially Realizable Functionals Extended Abstract

Martin Hyland, Andrea Schalk
2002

‹
1
2
›

References

Sorry, we couldn't extract any references for this paper.