Sciweavers

DLS
2008
149views Languages» more  DLS 2008»
13 years 6 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
COORDINATION
2008
Springer
13 years 6 months ago
From Flow Logic to Static Type Systems for Coordination Languages
Abstract. Coordination languages are often used to describe open ended systems. This makes it challenging to develop tools for guaranteeing security of the coordinated systems and ...
Rocco De Nicola, Daniele Gorla, René Rydhof...
CCS
2008
ACM
13 years 7 months ago
Type-checking zero-knowledge
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. We show how several properties offered by zero-knowl...
Michael Backes, Catalin Hritcu, Matteo Maffei
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 7 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi
BIRTHDAY
2008
Springer
13 years 7 months ago
A Type System for Client Progress in a Service-Oriented Calculus
We introduce a type system providing a guarantee of client progress for a fragment of CaSPiS, a recently proposed process calculus for serviceoriented applications. The interplay o...
Lucia Acciai, Michele Boreale
APLAS
2008
ACM
13 years 7 months ago
Sound and Complete Type Inference for a Systems Programming Language
This paper introduces a new type system designed for safe systems programming. The type system features a new mutability model that combines unboxed types with a consistent typing ...
Swaroop Sridhar, Jonathan S. Shapiro, Scott F. Smi...
FOSSACS
2010
Springer
13 years 8 months ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi
POPL
1991
ACM
13 years 8 months ago
Polymorphic Type Inference and Assignment
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
Xavier Leroy, Pierre Weis
POPL
1995
ACM
13 years 8 months ago
A Type System Equivalent to Flow Analysis
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accep...
Jens Palsberg, Patrick O'Keefe
TIC
2000
Springer
174views System Software» more  TIC 2000»
13 years 8 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett