A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Abstract--We study replication mechanisms that include ReedSolomon type codes as well as network coding in order to improve the probability of successful delivery within a given ti...
Eitan Altman, Francesco De Pellegrini, Lucile Sass...
In this paper we propose a scheme that combines type inference and run-time checking to make existing C programs type safe. We describe the CCured type system, which extends that ...
We investigate call-by-value continuation-passing style transforms that continuations. Altering a single variable in the translation of -abstraction gives rise to different control...
Dynamic scripting languages offer programmers increased flexibility by allowing properties of programs to be defined at run-time. Typically, program execution begins with an int...