7988 search results - page 1173 / 1598 » A Useful Undecidable Theory |
193
click to vote
ICFP
2008
ACM
16 years 7 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
184
click to vote
ICFP
2008
ACM
16 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...
209
click to vote
ICFP
2008
ACM
16 years 7 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
183
click to vote
ICFP
2007
ACM
16 years 7 months ago
2007
ACM
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
179
click to vote
ICFP
2006
ACM
16 years 7 months ago
2006
ACM
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...