Sciweavers

10 search results - page 1 / 2
» Stack inspection: theory and variants
Sort
View
POPL
2002
ACM
15 years 10 months ago
Stack inspection: theory and variants
Cédric Fournet, Andrew D. Gordon
101
Voted
ICFP
2005
ACM
15 years 10 months ago
Continuations from generalized stack inspection
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...
Greg Pettyjohn, John Clements, Joe Marshall, Shrir...
ICFP
2003
ACM
15 years 10 months ago
A static type system for JVM access control
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...
Tomoyuki Higuchi, Atsushi Ohori
90
Voted
OOPSLA
2010
Springer
14 years 8 months ago
The two-state solution: native and serializable continuations accord
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 ...
Jay A. McCarthy
79
Voted
LISP
2006
105views more  LISP 2006»
14 years 10 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
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...
Paul Blain Levy