1096 search results - page 92 / 220 » Type inference for atomicity |
LFCS
1992
Springer
14 years 1 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
EACL
2009
ACL Anthology
14 years 9 months ago
2009
ACL Anthology
Lexical-semantic resources are used extensively for applied semantic inference, yet a clear quantitative picture of their current utility and limitations is largely missing. We pr...
ACL
2012
11 years 11 months ago
2012
This paper introduces BIUTEE1 , an opensource system for recognizing textual entailment. Its main advantages are its ability to utilize various types of knowledge resources, and i...
AAAI
2006
13 years 10 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
SIGPLAN
2002
13 years 8 months ago
2002
We describe the design of a rule-based language for expressing changes to Haskell programs in a systematic and reliable way. The update language essentially offers update commands...