Sciweavers

365 search results - page 19 / 73
» Using Types as Approximations for Type Checking Prolog Progr...
Sort
View
ACSC
2004
IEEE
13 years 11 months ago
Strength Reduction for Loop-Invariant Types
Types are fundamental for enforcing levels of abstraction in modern high-level programming languages and their lower-level representations. However, some type-related features suc...
Phung Hua Nguyen, Jingling Xue
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 9 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
FLOPS
2008
Springer
13 years 9 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
TACAS
2007
Springer
108views Algorithms» more  TACAS 2007»
14 years 1 months ago
State of the Union: Type Inference Via Craig Interpolation
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
Ranjit Jhala, Rupak Majumdar, Ru-Gang Xu
POPL
1998
ACM
13 years 11 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...