20 search results - page 2 / 4 » Extensional Rewriting with Sums |
FLOPS
2008
Springer
13 years 6 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
EJC
2008
13 years 5 months ago
2008
We consider certain modules of the symmetric groups whose basis elements are called tabloids. As modules of the symmetric groups, some of these are isomorphic to Springer modules. ...
RTA
1997
Springer
13 years 9 months ago
1997
Springer
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
IANDC
2006
13 years 5 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 ...
JSC
2010
13 years 3 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...