31 search results - page 6 / 7 » Relational Parametricity for a Polymorphic Linear Lambda Cal... |
POPL
2004
ACM
14 years 6 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
ICFP
2008
ACM
14 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...
ICFP
2007
ACM
14 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
HASKELL
2008
ACM
13 years 7 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
CTCS
1989
Springer
13 years 10 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...