Book contents
- Frontmatter
- Contents
- List of Illustrations
- List of Notations
- Introduction: Alice, Bob, Concurrency, and Distribution
- This Book
- Part I Foundations
- Part II Computation
- 5 Memory and Local Computation
- 6 Conditionals and Knowledge of Choice
- 7 Recursion
- 8 Properties of Choreographies and Endpoint Projection
- Part III Extensions and Variations
- Solutions to Selected Exercises
- References
- Index
7 - Recursion
from Part II - Computation
Published online by Cambridge University Press: 11 May 2023
Book contents
- Frontmatter
- Contents
- List of Illustrations
- List of Notations
- Introduction: Alice, Bob, Concurrency, and Distribution
- This Book
- Part I Foundations
- Part II Computation
- 5 Memory and Local Computation
- 6 Conditionals and Knowledge of Choice
- 7 Recursion
- 8 Properties of Choreographies and Endpoint Projection
- Part III Extensions and Variations
- Solutions to Selected Exercises
- References
- Index
Summary
The syntax of choreographies is enhanced with the possibility of writing and invoking recursive procedures, yielding the language of Recursive Choreographies. This opens the door to modelling protocols that allow for retries and data streams of unbounded length. The language of process implementations and the notion of EPP are updated accordingly.
- Type
- Chapter
- Information
- Introduction to Choreographies , pp. 134 - 155Publisher: Cambridge University PressPrint publication year: 2023