Sciweavers

248 search results - page 25 / 50
» Phantom types and subtyping
Sort
View
IWPC
1999
IEEE
13 years 12 months ago
Understanding COBOL Systems using Inferred Types
In a typical COBOL program, the data division consists of 50% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations ...
Arie van Deursen, Leon Moonen
LICS
2000
IEEE
13 years 11 months ago
Efficient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
Jens Palsberg, Tian Zhao
ESOP
2000
Springer
13 years 11 months ago
Secure Information Flow as Typed Process Behaviour
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...
Kohei Honda, Vasco Thudichum Vasconcelos, Nobuko Y...
ECOOP
2010
Springer
13 years 9 months ago
Adding Dynamic Types to C#
Developers using statically typed languages such as C and Java are increasingly having to interoperate with APIs and object models defined in dynamic languages. This impedance mis...
Gavin M. Bierman, Erik Meijer, Mads Torgersen
LICS
2010
IEEE
13 years 6 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin