76 search results - page 8 / 16 » Termination of just fair computations in term rewriting |
HOA
1993
15 years 3 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
91
Voted
NETWORKING
2000
15 years 1 months ago
2000
Abstract. We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on...
103
Voted
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
96
Voted
CONCUR
2003
Springer
15 years 4 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...