Authors: Zoran Petric, Kosta Dosen
Title: Coherence and Confluence
Abstract:
It seems that what categorists call coherence logicians
would, roughly speaking, call completeness. This is a question whether
we assumed for a particular brand of categories all the equations
between arrows we should have assumed. The simplest coherence questions
are those where it is intended that all arrows of the same type should
be equal, i.e. where the category envisaged is a preorder. In such
cases a technique similar to the one used in proving confluence of
reductions in lambda-calculus can be applied.