onnectivity and Full Abstraction for a Concurrent Calculus of Classes⋆ nded Abstract — Erika ´Abrah´am2 , Marcello M. Bonsangue3 , Frank S. de Boer4 , and Martin Steffen1 1 ...
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Abstract. From several decades, non-adjacent form (NAF) representations for integers have been extensively studied as an alternative to the usual binary number system where digits ...