3238 search results - page 119 / 648 » On the Computational Interpretation of Negation |
180
click to vote
DLT
2006
15 years 7 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
168
click to vote
COMPUTER
2002
15 years 6 months ago
2002
tail defines the level of abstraction used to implement the model's components. A highly detailed model will faithfully simulate all aspects of machine operation, whether or n...
175
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
160
click to vote
HOTOS
1997
IEEE
15 years 10 months ago
1997
IEEE
ty of accurately re-creating a mobile networkingAbstract environment in vitro argues for live experiments. On the In this paper we put forth the view that trace other hand, the dif...
167
click to vote
CLEIEJ
2008
15 years 6 months ago
2008
A lot of material has been written about wavelet theory. Most of these texts provide an elegant framework from the functional and real analysis point of view. The complete infinit...