124
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
116
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
145
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We propose a new type discipline for the -calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are...
133
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
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,...
120
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We describe a low-level calculus, called ink (pronounced "links"), designed to serve as an intermediate representation in compilers for class-based objectorient...