479 search results - page 83 / 96 » The theory and calculus of aliasing |
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
CSFW
2009
IEEE
14 years 2 months ago
2009
IEEE
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...