Sciweavers

ICFP
1999
ACM
13 years 9 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
CONCUR
2000
Springer
13 years 9 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
CONCUR
2001
Springer
13 years 9 months ago
Typing Mobility in the Seal Calculus
The issue of this work is how to type mobility, in the sense that we tackle the problem of typing not only mobile agents but also their movement. This yields higher-order types for...
Giuseppe Castagna, Giorgio Ghelli, Francesco Zappa...
PPDP
2009
Springer
13 years 9 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
ECOOP
2010
Springer
13 years 9 months ago
Capabilities for Uniqueness and Borrowing
Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects...
Philipp Haller, Martin Odersky
LICS
2002
IEEE
13 years 9 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
ECOOP
2003
Springer
13 years 9 months ago
A Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
Martin Odersky, Vincent Cremet, Christine Röc...
ERLANG
2003
ACM
13 years 9 months ago
Evaluating distributed functional languages for telecommunications software
The distributed telecommunications sector not only requires minimal time to market, but also software that is reliable, available, maintainable and scalable. High level programmin...
Jan Henry Nyström, Philip W. Trinder, David J...
DEBS
2003
ACM
13 years 9 months ago
Relational subscription middleware for Internet-scale publish-subscribe
We present a design of a distributed publish-subscribe system that extends the functionality of messaging middleware with “relational subscriptions”, to support timely updates...
Yuhui Jin, Robert E. Strom
VMCAI
2004
Springer
13 years 10 months ago
Type Inference for Parameterized Race-Free Java
Abstract. We study the type system introduced by Boyapati and Rinard in their paper “A Parameterized Type System for Race-Free Java Programs” and try to infer the type annotati...
Rahul Agarwal, Scott D. Stoller