228 search results - page 17 / 46 » An effective theory of type refinements |
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
CHI
2010
ACM
14 years 2 months ago
2010
ACM
Interest has been growing within HCI on the use of machine learning and reasoning in applications to classify such hidden states as user intentions, based on observations. HCI res...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
Much research in multi-agent systems reflects the field’s origins in classical artificial intelligence, showing how various refinements to the internal reasoning of individual a...
LICS
1994
IEEE
13 years 12 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...