272 search results - page 3 / 55 » Programming languages capturing complexity classes |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
IFIP
2004
Springer
14 years 23 days ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
Haskell’s multi-parameter type classes, together with functional dependencies, allow the specification of complex type-level opera
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...