# An Algebraic Treatment of Recursion

**Authors:** Rob van Glabbeek

arXiv: 1702.07838 · 2017-02-28

## TL;DR

This paper reviews the main methods for defining recursion in process algebra and extends the algebraic approach to handle unguarded recursion, providing a comprehensive algebraic framework.

## Contribution

It introduces an extension of the algebraic method to accommodate unguarded recursion in process algebra.

## Key findings

- Extended algebraic approach to unguarded recursion
- Unified view of denotational, operational, and algebraic methods
- Enhanced algebraic framework for recursion

## 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1702.07838/full.md

## References

5 references — full list in the complete paper: https://tomesphere.com/paper/1702.07838/full.md

---
Source: https://tomesphere.com/paper/1702.07838