8099 search results - page 16 / 1620 » Higher-Order Task Models |
119
click to vote
AGP
2010
IEEE
15 years 4 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
118
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
104
click to vote
CADE
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
97
Voted
ECAI
2010
Springer
14 years 12 months ago
2010
Springer
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}] expressing that the coalition of all agents satisfying (x) can ac...