Results 1  10
of
213,485
Term Rewriting Systems
, 1992
"... Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss Abstra ..."
Abstract

Cited by 613 (18 self)
 Add to MetaCart
Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss
Infinitary Term Graph Rewriting
, 2011
"... Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can be used to reason about lazy evaluation. In this paper, we ..."
Abstract
 Add to MetaCart
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can be used to reason about lazy evaluation. In this paper, we
On Modularity in Infinitary Term Rewriting
"... We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are noncollapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved acro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are noncollapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved
Infinitary Rewriting Coinductively
"... We provide a coinductive definition of strongly convergent reductions between infinite lambda terms. This approach avoids the notions of ordinals and metric convergence which have appeared in the earlier definitions of the concept. As an illustration, we prove the existence part of the infinitary st ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We provide a coinductive definition of strongly convergent reductions between infinite lambda terms. This approach avoids the notions of ordinals and metric convergence which have appeared in the earlier definitions of the concept. As an illustration, we prove the existence part of the infinitary
Infinitary Rewriting and Cyclic Graphs
 Electronic Notes in Theoretical Computer Science
, 1995
"... Infinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation techni ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Infinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 542 (0 self)
 Add to MetaCart
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I
Infinitary rewriting  Theory and Applications
, 2009
"... Infinitary rewriting generalises usual finitary rewriting by providing infinite reduction sequences with a notion of convergence. The idea of – at least conceptually – assigning a meaning to infinite derivations is wellknown, for example, from lazy functional programming or from process calculi. In ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
. Infinitary rewriting makes it possible to apply rewriting in order to obtain a formal model for such infinite derivations. The goal of this thesis is to comprehensively survey the field of infinitary term rewriting, to point out its shortcomings, and to try to overcome some of these shortcomings. The most
Infinitary rewriting: Foundations revisited
 Proceedings of the 21st International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics (LIPIcs
, 2010
"... Abstract. Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary relations in particular two concepts have been studied in the past: strongly and weakly convergent reductions, an ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary relations in particular two concepts have been studied in the past: strongly and weakly convergent reductions
On the modularity of confluence in infinitary term rewriting
 In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA ’04), volume 3091 of Lecture Notes in Computer Science
, 2004
"... Abstract. We show that, unlike the case in finitary term rewriting, confluence is not a modular property of infinitary term rewriting systems, even when these are noncollapsing. We also give a positive result: two sufficient conditions for the modularity of confluence in the infinitary setting. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We show that, unlike the case in finitary term rewriting, confluence is not a modular property of infinitary term rewriting systems, even when these are noncollapsing. We also give a positive result: two sufficient conditions for the modularity of confluence in the infinitary setting. 1
Results 1  10
of
213,485