325 search results - page 23 / 65 » Proofs of Restricted Shuffles |
APLAS
2009
ACM
14 years 4 months ago
2009
ACM
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
ETFA
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— This work deals with the control and the observation of a remote system using Internet as a communication line. The process consists in a Slave part S, with poor comput...
FOSSACS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
WAOA
2004
Springer
14 years 3 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
LICS
2003
IEEE
14 years 3 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...