921 search results - page 56 / 185 » Expressing Computational Complexity in Constructive Type The... |
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...
ICSE
2005
IEEE-ACM
14 years 8 months ago
2005
IEEE-ACM
When building scalable systems that involve general-purpose computation and persistent data, object-oriented languages and relational databases are often essential components. Yet...
PPDP
2005
Springer
14 years 1 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
GG
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
POPL
2010
ACM
14 years 5 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...