کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9657783 | 690375 | 2005 | 45 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Sequential algorithms and strongly stable functions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Sequential algorithms and strongly stable functions Sequential algorithms and strongly stable functions](/preview/png/9657783.png)
چکیده انگلیسی
Intuitionistic proofs and PCF programs may be interpreted as functions between domains, or as strategies on games. The two kinds of interpretation are inherently different: static vs. dynamic, extensional vs. intentional. It is thus extremely instructive to compare and to connect them. In this article, we investigate the extensional content of the sequential algorithm hierarchy [-]SDS introduced by Berry and Curien. We equip every sequential game [T]SDS of the hierarchy with a realizability relation between plays and extensions. In this way, the sequential game [T]SDS becomes a directed acyclic graph, instead of a tree. This enables to define a hypergraph [T]HC on the extensions (or terminal leaves) of the game [T]SDS. We establish that the resulting hierarchy [-]HC coincides with the strongly stable hierarchy introduced by Bucciarelli and Ehrhard. We deduce from this a game-theoretic proof of Ehrhard's collapse theorem, which states that the strongly stable hierarchy coincides with the extensional collapse of the sequential algorithm hierarchy.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 343, Issues 1â2, 10 October 2005, Pages 237-281
Journal: Theoretical Computer Science - Volume 343, Issues 1â2, 10 October 2005, Pages 237-281
نویسندگان
Paul-André Melliès,