HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A note on guarded recursion

Eric Badouel 1 Philippe Darondeau 1
1 MICAS - Modèles et implémentation des calculs syntaxiques
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We introduce a logical notion of well-guardedness for recursive terms on arbitrary signatures defined in Plotkin's framework of structural operational specifications, restricted by de Simone's realizability requirements. We then 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. For well-guarded terms, the simplified rule is logically equivalent to the general rule, but is has not the draw-back to ask for premises more complex that consequences.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 5:56:20 PM
Last modification on : Friday, February 4, 2022 - 3:25:26 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 10:26:38 PM


  • HAL Id : inria-00075309, version 1


Eric Badouel, Philippe Darondeau. A note on guarded recursion. [Research Report] RR-1249, INRIA. 1990. ⟨inria-00075309⟩



Record views


Files downloads