Sciweavers

251 search results - page 6 / 51
» Pure Type Systems without Explicit Contexts
Sort
View
CONCUR
2005
Springer
14 years 1 months ago
Games Where You Can Play Optimally Without Any Memory
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...
Hugo Gimbert, Wieslaw Zielonka
FLOPS
2010
Springer
14 years 2 months ago
A Church-Style Intermediate Language for MLF
MLF is a type system that seamlessly merges ML-style implicit but second-class polymorphism with System F explicit first-class polymorphism. We present xMLF, a Church-style versi...
Didier Rémy, Boris Yakobowski
GPCE
2005
Springer
14 years 1 months ago
Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...
Martin Bravenboer, Rob Vermaas, Jurgen J. Vinju, E...
AMMA
2009
Springer
14 years 2 months ago
Manipulating Scrip Systems: Sybils and Collusion
Abstract. Game-theoretic analyses of distributed and peer-to-peer systems typically use the Nash equilibrium solution concept, but this explicitly excludes the possibility of strat...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
WWW
2004
ACM
14 years 8 months ago
Towards context-aware adaptable web services
In this paper, we present a context framework that facilitates the development and deployment of context-aware adaptable Web services. Web services are provided with context infor...
Markus Keidl, Alfons Kemper