535 search results - page 5 / 107 » Termination of Abstract Reduction Systems |
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
IFIP
2004
Springer
14 years 3 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
RTA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed ...
LICS
2010
IEEE
13 years 8 months ago
2010
IEEE
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...