41 search results - page 5 / 9 » Order-Incompleteness and Finite Lambda Models (Extended Abst... |
108
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...
135
Voted
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
124
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunifica...
133
Voted
IANDC
2006
15 years 3 months ago
2006
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
143
click to vote
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...