546 search results - page 93 / 110 » Substructural Operational Semantics as Ordered Logic Program... |
112
click to vote
COLING
1996
15 years 4 months ago
1996
In this paper we sketch a decidable inference-based procedure for lexical disambiguation which operates on semantic representations of discourse and conceptual knowledge, In contr...
120
click to vote
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
134
click to vote
LFP
1992
15 years 4 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
150
click to vote
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
147
click to vote
CAV
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...