Term graph rewriting and garbage collection using opfibrations (Q1331928)

Many constructions using pullbacks can be generalized to fibrations. This paper employs the dual process: pushouts are replaced by opfibrations. Specifically, the term graph rewriting language DACTL is modelled by an opfibration in which the rewrite rules appear as arrows of the base category, while actual rewrites appear in the fibres. The main advantages seem to be that all the rules of DACTL are modelled correctly (unlike earlier efforts) and that the semantics gives a clear account of garbage collection.