An Algebraic Treatment of Recursion
Logic in Computer Science
2017-02-28 v1
Abstract
I review the three principal methods to assign meaning to recursion in process algebra: the denotational, the operational and the algebraic approach, and I extend the latter to unguarded recursion.
Keywords
Cite
@article{arxiv.1702.07838,
title = {An Algebraic Treatment of Recursion},
author = {Rob van Glabbeek},
journal= {arXiv preprint arXiv:1702.07838},
year = {2017}
}
Comments
Dedicated to Jan Bergstra, at the occasion of his 65th birthday and retirement