On guarded recursion
type: Item
instance of: scholarly article
title: On guarded recursion
zbMATH Open document ID: 0728.68079
DOI: 10.1016/0304-3975(91)90231-P
author: Eric Badouel
author: Philippe Darondeau
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
review text: This paper presents the new logical notion of well-guardedness for recursive terms on arbitrary signatures in process algebras of structural operational semantics. Then the authors suggest a simpler form for the logical rule that gives the behaviour of a recursively defined expression in terms of the behaviour of its unfoldings. The logically equivalence between the simplified rule and the general rule for well-guardedness terms is proved. Finally, an important feature of this simplified rule, that the terms appearing in the premises are always simpler than the terms appearing in the consequence, is discussed.
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 4203733
zbMATH Keywords: recursive terms
zbMATH Keywords: process algebras
reviewed by: P.-G. Holban
MaRDI profile type: Publication
cites work: Q3700824
cites work: A calculus of communicating systems
cites work: A structural approach to operational semantics
description: scientific article; zbMATH DE number 4203733