1948 search results - page 206 / 390 » Formalizing Mirror Theory |
178
click to vote
ICFP
2008
ACM
16 years 6 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...
176
click to vote
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
168
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
191
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
182
click to vote
HICSS
2009
IEEE
16 years 1 months ago
2009
IEEE
The mechanisms and design principles needed for achieving optimized handoff for mobile Internet services are poorly understood and need better analysis. This paper contributes to ...