Sciweavers

159 search results - page 12 / 32
» An extended comparative study of language support for generi...
Sort
View
ICALP
2007
Springer
13 years 11 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
FPCA
1993
13 years 11 months ago
Benchmarking Implementations of Lazy Functional Languages
Five implementations of di erent lazy functional languages are compared using a common benchmark of a dozen medium size programs. The benchmarking procedure has been designed such...
Pieter H. Hartel, Koen Langendoen
JOOP
1998
98views more  JOOP 1998»
13 years 7 months ago
Design Patterns as Language Constructs
Design patterns have proven to be very useful for the design of object-oriented systems. The power of design patterns stems from their ability to provide generic solutions to reap...
Jan Bosch
VEE
2009
ACM
146views Virtualization» more  VEE 2009»
14 years 2 months ago
Demystifying magic: high-level low-level programming
r of high-level languages lies in their abstraction over hardware and software complexity, leading to greater security, better reliability, and lower development costs. However, o...
Daniel Frampton, Stephen M. Blackburn, Perry Cheng...
IFIP
2004
Springer
14 years 25 days ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells