Sciweavers

207 search results - page 13 / 42
» Elementary Strong Functional Programming
Sort
View
POPL
1997
ACM
13 years 12 months ago
Pizza into Java: Translating Theory into Practice
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is d...
Martin Odersky, Philip Wadler
QNS
1996
13 years 9 months ago
Real Inferno
Inferno is an operating system well suited to applications that need to be portable, graphical, and networked. This paper describes the fundamental oating point facilities of the...
Eric Grosse
CIE
2006
Springer
13 years 11 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
13 years 6 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani
MP
2007
102views more  MP 2007»
13 years 7 months ago
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...
Mihai Anitescu, Paul Tseng, Stephen J. Wright