Sciweavers

32 search results - page 1 / 7
» Sharing Continuations: Proofnets for Languages with Explicit...
Sort
View
ESOP
2000
Springer
13 years 9 months ago
Sharing Continuations: Proofnets for Languages with Explicit Control
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
Julia L. Lawall, Harry G. Mairson
IPPS
2000
IEEE
13 years 10 months ago
Controlling Distributed Shared Memory Consistency from High Level Programming Languages
One of the keys for the success of parallel processing is the availability of high-level programming languages for on-the-shelf parallel architectures. Using explicit message passi...
Yvon Jégou
PPDP
2010
Springer
13 years 4 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
AOSD
2010
ACM
14 years 12 days ago
EffectiveAdvice: disciplined advice with explicit effects
Advice is a mechanism, widely used in aspect-oriented languages, that allows one program component to augment or modify the behavior of other components. When advice and other com...
Bruno C. d. S. Oliveira, Tom Schrijvers, William R...
APLAS
2007
ACM
13 years 9 months ago
Polymorphic Delimited Continuations
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
Kenichi Asai, Yukiyoshi Kameyama