Full abstraction and universality via realisability

被引：0

|

作者：

Technische Universitat Darmstadt ^{[1
]}

机构：

来源：

Proc Symp Logic Comput Sci | / 174-182期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[41] Full-Abstraction for Must Testing Preorders
Bernardi, Giovanni
Francalanza, Adrian
COORDINATION MODELS AND LANGUAGES, COORDINATION 2017, 2017, 10319 : 237 - 255
[42] Strong fairness and full abstraction for communicating processes
Older, S
INFORMATION AND COMPUTATION, 2000, 163 (02) : 471 - 509
[43] Full abstraction for polymorphic Pi-calculus
Jeffrey, A
Rathke, J
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2005, 3441 : 266 - 281
[44] FULL ABSTRACTION FOR SERIES-PARALLEL POMSETS
ACETO, L
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 493 : 1 - 25
[45] Full Abstraction for the Quantum Lambda-Calculus
Clairambault, Pierre
de Visme, Marc
PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (POPL):
[46] Full-abstraction for client testing preorders
Bernardi, Giovanni
Francalanza, Adrian
SCIENCE OF COMPUTER PROGRAMMING, 2018, 168 : 94 - 117
[47] Full abstraction for expressiveness: history, myths and facts
Gorla, Daniele
Nestmann, Uwe
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2016, 26 (04) : 639 - 654
[48] CORRECTNESS AND FULL ABSTRACTION OF METRIC SEMANTICS FOR CONCURRENCY
RUTTEN, JJMM
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 354 : 628 - 659
[49] FULL ABSTRACTION IN THE LAZY LAMBDA-CALCULUS
ABRAMSKY, S
ONG, CHL
INFORMATION AND COMPUTATION, 1993, 105 (02) : 159 - 267
[50] On full abstraction for PCF: I, II, and III
Hyland, JME
Ong, CHL
INFORMATION AND COMPUTATION, 2000, 163 (02) : 285 - 408

← 1 2 3 4 5 →