175 search results - page 5 / 35 » A Complete and Recursive Feature Theory |
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
UAI
2001
13 years 8 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...