Guarded Recursion
Guarded Recursion is a syntactic restriction in process algebra that ensures recursive process definitions are well-defined by requiring recursion to occur only under the scope of a prefixing action, thereby preventing immediate self-replication and guaranteeing unique solutions to recursive equations.
40
Publications
2.5K
Citations
54
Authors
36
Institutions
Publications per year
2017–2026
10
Parents
40
Communicating sequential processes
C. A. R. Hoare · Communications of the ACM · 1978 · 3.5K citations · Full text
Bard Bloom, Sorin Istrail, Albert R. Meyer · Journal of the ACM · 1995 · 384 citations · Full text
Simple unification-based type inference for GADTs
Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich et al. · 2006 · 336 citations
Guarded recursive datatype constructors
Hongwei Xi, Chiyan Chen, Gang Chen · 2003 · 329 citations
1–5 of 40
54
7
h-index
7
h-index
3
h-index
3
h-index
3
h-index
1–5 of 54
36

Aarhus University
Aarhus, Denmark
9 h-index
17 publications
451 citations

IT University of Copenhagen
Copenhagen, Denmark
9 h-index
13 publications
267 citations
Friedrich-Alexander-Universität Erlangen-Nürnberg
Erlangen, Germany
3 h-index
7 publications
86 citations

University of Strathclyde
Glasgow, United Kingdom
2 h-index
2 publications
99 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
2 h-index
2 publications
98 citations
Quantemplate (United Kingdom)
London, United Kingdom
2 h-index
2 publications
99 citations
California University of Pennsylvania
California, United States
2 h-index
6 publications
1.1K citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
2 publications
383 citations
1–8 of 36
ENTCS · 5 publications · 119 citations
5
h-index
MSCS · 3 publications · 78 citations
3
h-index
LMCS · 3 publications · 45 citations
3
h-index
3 publications · 111 citations
3
h-index
Repository · 1 publications · 13 citations
1
h-index
1–5