34 search results - page 4 / 7 » popl 2006 |
159
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
160
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
142
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
196
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
164
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...