
doi: 10.1007/bfb0022470
This paper studies the denotational semantics of programming language constructs whose operational semantics require interleaving of computations. In particular a semantics is given for recursion equations with a convergence test. A convergence test is a nondeterministic construct which selects among expressions according to which one converges (i.e. takes on a value) first. This denotational semantics is shown to be equivalent to an operational semantics.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
