Sciweavers

Abstract. We study the efﬁcient implementation of call-by-value using the structure of interactive computation models. This structure has been useful in applications to resource-...

Ulrich Schöpp

claim paper

Read More »

103

click to vote

APLAS
2015
ACM

14views Programming Languages» more APLAS 2015»

Quasi-Linearizability is Undecidable

9 years 10 months ago

Download lcs.ios.ac.cn

Abstract. Quasi-linearizability is a quantitative relaxation of linearizability. It preserves the intuition of the standard notion of linearizability and permits more ﬂexibility....

Chao Wang, Yi Lv, Gaoang Liu, Peng Wu 0002

claim paper

Read More »

102

click to vote

APLAS
2015
ACM

23views Programming Languages» more APLAS 2015»

Shifting the Blame - A Blame Calculus with Delimited Control

9 years 10 months ago

Download www.fos.kuis.kyoto-u.ac.jp

We study integration of static and dynamic typing in the presence of delimited-control operators. In a program where typed and untyped parts coexist, the run-time system has to mon...

Taro Sekiyama, Soichiro Ueda, Atsushi Igarashi

claim paper

Read More »

click to vote

APLAS
2015
ACM

15views Programming Languages» more APLAS 2015»

Kripke Open Bisimulation - A Marriage of Game Semantics and Operational Techniques

9 years 10 months ago

Download guilhem.jaber.fr

Proving that two programs are contextually equivalent is notoriously hard, particularly for functional languages with references (i.e., local states). Many operational techniques h...

Guilhem Jaber, Nicolas Tabareau

claim paper

Read More »

All Subjects

Algorithms

Applied Computing

Artificial Intelligence