6 citations found. Retrieving documents...
T. Ehrhard. A relative definability result for strongly stable functions and some corollaries. In Information and Computation, 1997.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Games on Graphs and Sequentially Realizable Functionals - Exte Nd Ed   (Correct)

....algorithms model. We briefly consider a more extensional setting and the prospects for a better understanding of the Longley Conjecture. 1 Introduction Ehrhard s striking result that his hypercoherence model for PCF can be obtained as the extensional collapse of the sequential algorithms [6] was the first evidence that there is a natural class of those extensional functionals of higher type which can be computed by a sequential program. Other characterizations of this class have been given by van Oosten [12] and by Longley whose substantial paper [10] describes equivalences which ....

T. Ehrhard. A relative definability result for strongly stable functions and some corollaries. Information and Computation, 152:111--137, 1999.


Parallel and Serial Hypercoherences - Ehrhard (1995)   (2 citations)  Self-citation (Ehrhard)   (Correct)

....Intuitively, it makes explicit the computational time of a hypercoherence. Notice: This is a preliminary version of the paper [Ehr00] entitled Parallel and serial hypercoherences , published in Theoretical Computer Science, North Holland, volume 247, pages 39 81, 2000. Introduction In [Ehr99], we proved that the hypercoherence model of 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 ....

Thomas Ehrhard. A relative definability result for strongly stable functions and some corollaries. Information and Computation, 152:111--137, 1999.


Anatomy of an Extensional Collapse - Barreiro, Ehrhard (1997)   (4 citations)  Self-citation (Ehrhard)   (Correct)

....as follows: In the hierarchy of simple types, the set theoretic coherent semantics is the extensional collapse of the multiset theoretic semantics 2 . The proof of this intuitively very natural result follows a pattern which can be found in other recent proofs of similar results (see [Buc96, Ehr96]) it is based on the fact that the heterogeneous relation is onto for finite cliques 3 . This means that, for any type, any finite clique of the set theoretic interpretation of this type is related (by the heterogeneous relation) to some clique of the multiset theoretic semantics of the same ....

....to the heterogeneous relation. Beyond the fact that is allows for proving the theorem above on the extensional collapse of the multiset theoretical semantics, the real outcome of this approach is that it gives an insight on the internal structure of the heterogeneous relation (compare with [Ehr96] where a similar theorem is 2 This is also due to the fact that the heterogeneous relation is a partial function from the cliques of the multisettheoretic interpretation of a type to the cliques of the settheoretic interpretation of the same type. 3 From this, one easily deduces that it is a ....

Thomas Ehrhard. A relative definability result for strongly stable functions and some corollaries. To appear in Information and Computation, 1996. 11


Comparing Hierarchies of Types in Models of Linear Logic - Mellies (2003)   (1 citation)  (Correct)

No context found.

T. Ehrhard. A relative definability result for strongly stable functions and some corollaries. In Information and Computation, 1997.


Sequential Algorithms and Strongly Stable Functions - Mellies   (Correct)

No context found.

T. Ehrhard. A relative definability result for strongly stable functions and some corollaries. Information and Computation, 1997.


Asynchronous Games 2 - The true concurrency of innocence - Mellies (2004)   (1 citation)  (Correct)

No context found.

T. Ehrhard. A relative definability result for strongly stable functions and some corollaries. Information and Computation, 1997.

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