Displaying 141 – 160 of 196

Showing per page

Rewriting on cyclic structures: Equivalence between the operational and the categorical description

Andrea Corradini, Fabio Gadducci (2010)

RAIRO - Theoretical Informatics and Applications

We present a categorical formulation of the rewriting of possibly cyclic term graphs, based on a variation of algebraic 2-theories. We show that this presentation is equivalent to the well-accepted operational definition proposed by Barendregt et al. – but for the case of circular redexes , for which we propose (and justify formally) a different treatment. The categorical framework allows us to model in a concise way also automatic garbage collection and rules for sharing/unsharing and...

Strongly groupoid graded rings and cohomology

Patrik Lundström (2006)

Colloquium Mathematicae

We interpret the collection of invertible bimodules as a groupoid and call it the Picard groupoid. We use this groupoid to generalize the classical construction of crossed products to what we call groupoid crossed products, and show that these coincide with the class of strongly groupoid graded rings. We then use groupoid crossed products to obtain a generalization from the group graded situation to the groupoid graded case of the bijection from a second cohomology group, defined by the grading...

Currently displaying 141 – 160 of 196