Full abstraction and universality via realisability

被引：0

|

作者：

Technische Universitat Darmstadt ^{[1
]}

机构：

来源：

Proc Symp Logic Comput Sci | / 174-182期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[31] FULL ABSTRACTION FOR NOMINAL GENERAL REFERENCES
Tzevelekos, Nikos
LOGICAL METHODS IN COMPUTER SCIENCE, 2009, 5 (03)
[32] Bidomains and full abstraction for countable nondeterminism
Laird, James
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2006, 3921 : 352 - 366
[33] Full Abstraction for Nominal Scott Domains
Loesch, Steffen
Pitts, Andrew M.
ACM SIGPLAN NOTICES, 2013, 48 (01) : 3 - 14
[34] Full Abstraction Without Synchronization Primitives
Murawski, Andrzej S.
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2010, 265 : 423 - 436
[35] On Applicative Similarity, Sequentiality, and Full Abstraction
Crubille, Raphaelle
Dal Lago, Ugo
Sangiorgi, Davide
Vignudelli, Valeria
CORRECT SYSTEM DESIGN: SYMPOSIUM IN HONOR OF ERNST-RUDIGER OLDEROG ON THE OCCASION OF HIS 60TH BIRTHDAY, 2015, 9360 : 65 - 82
[36] Universality in the Full Counting Statistics of Trapped Fermions
Eisler, Viktor
PHYSICAL REVIEW LETTERS, 2013, 111 (08)
[37] FULL ABSTRACTION AND LIMITING COMPLETENESS IN EQUATIONAL LANGUAGES
THATTE, SR
THEORETICAL COMPUTER SCIENCE, 1989, 65 (01) : 85 - 119
[38] Identification and counter abstraction for full virtual symmetry
Wei, O
Gurfinkel, A
Chechik, M
CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2005, 3725 : 285 - 300
[39] Full abstraction for Idealized Algol with passive expressions
Abramsky, S
McCusker, G
THEORETICAL COMPUTER SCIENCE, 1999, 227 (1-2) : 3 - 42
[40] Edifices and full abstraction for the symmetric interaction combinators
Mazza, Damiano
Typed Lambda Calculi and Applications, Proceedings, 2007, 4583 : 305 - 320

← 1 2 3 4 5 →