10 search results - page 1 / 2 » Stack inspection: theory and variants |
166
Voted
POPL
2002
ACM
15 years 12 months ago
2002
ACM
106
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
117
Voted
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents a static type system for JAVA Virtual Machine (JVM) code that enforces an access control mechanism similar to the one found, for example, in a JAVA implementat...
97
Voted
OOPSLA
2010
Springer
14 years 10 months ago
2010
Springer
Continuation-based Web servers provide advantages over traditional Web application development through the increase of expressive power they allow. This leads to fewer errors and ...
87
Voted
LISP
2006
14 years 11 months ago
2006
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...