4 search results - page 1 / 1 » A Probabilistic Forest-to-String Model for Language Generati... |
EMNLP
2011
12 years 4 months ago
2011
FOCS
1998
IEEE
13 years 8 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
IJCAI
2001
13 years 6 months ago
2001
In a rational programming language, a program specifies a situation faced by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the...
ESOP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...