An Approach to Call-by-Name Delimited Continuations

被引：15

|

作者：

Herbelin, Hugo

Ghilezan, Silvia

机构：

来源：

POPL'08: PROCEEDINGS OF THE 35TH ANNUAL ACM SIGPLAN-SIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES | 2008年

关键词：

Delimited control; Observational completeness; Bohm separability; Classical logic;

D O I：

10.1145/1328438.1328484

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：383 / 394

页数：12

相关论文

共 50 条

[31] Effectful applicative similarity for call-by-name lambda calculi
Dal Lago, Ugo
Gavazzo, Francesco
Tanaka, Ryo
THEORETICAL COMPUTER SCIENCE, 2020, 813 : 234 - 247
[32] Call-by-name, call-by-value, call-by-need and the linear lambda calculus
Maraist, J
Odersky, M
Turner, DN
Wadler, P
THEORETICAL COMPUTER SCIENCE, 1999, 228 (1-2) : 175 - 210
[33] Formal Verification of the Correspondence Between Call-by-Need and Call-by-Name
Mizuno, Masayuki
Sumii, Eijiro
FUNCTIONAL AND LOGIC PROGRAMMING, FLOPS 2018, 2018, 10818 : 1 - 16
[34] Semantics of linear continuation-passing in call-by-name
Hasegawa, M
FUNCTIONAL AND LOGIC PROGRAMMING, 2004, 2998 : 229 - 243
[35] Delimited continuations in operating systems
Kiselyovi, Oleg
Shan, Chung-Chieh
MODELING AND USING CONTEXT, 2007, 4635 : 291 - 302
[36] A monadic framework for delimited continuations
Dyvbig, R. Kent
Jones, Simon Peyton
Sabry, Amr
JOURNAL OF FUNCTIONAL PROGRAMMING, 2007, 17 (06) : 687 - 730
[37] On the dynamic extent of delimited continuations
Biernacki, D
Danvy, O
Shan, CC
INFORMATION PROCESSING LETTERS, 2005, 96 (01) : 7 - 17
[38] Answer type polymorphism in call-by-name continuation passing
Thielecke, H
PROGRAMMING LANGUAGES AND SYSTEMS, 2004, 2986 : 279 - 293
[39] CALL-BY-VALUE AND CALL-BY-NAME DUAL CALCULI WITH INDUCTIVE AND COINDUCTIVE TYPES
Kimura, Daisuke
Tatsuta, Makoto
LOGICAL METHODS IN COMPUTER SCIENCE, 2013, 9 (01)
[40] Games for complexity of second-order call-by-name programs
Murawski, AS
THEORETICAL COMPUTER SCIENCE, 2005, 343 (1-2) : 207 - 236

← 1 2 3 4 5 →