Journal of the ACM Bibliography
K.
R. Apt and G. D.
Plotkin. Countable nondeterminism and random assignment.
Journal of the ACM, 33(4):724-767, October 1986.
[BibTeX entry]
Selected papers that cite this one
- Luca Aceto and Anna Ingólfsdóttir. CPO models for compact GSOS
languages. Information and Computation, 129(2):107-141,
15 September 1996.
- Stephen Brookes. Full
abstraction for a shared-variable parallel language.
Information and Computation, 127(2):145-163, 15 June 1996.
- Patrick Cousot and Radhia Cousot. Abstract
interpretation frameworks. Journal of Logic and
Computation, 2(4):511-547, August 1992.
- Ugo de'Liguoro and Adolfo Piperno. Non deterministic extensions of
untyped lambda-calculus. Information and Computation,
122(2):149-177, 1 November 1995.
- P. Di Gianantonio, F. Honsell, and G. Plotkin. Uncountable
limits and the lambda calculus. Nordic Journal of
Computing, 2(2):126-145, Summer 1995.
- Thomas F. Gritzner and Rudolf Berghammer. A relation algebraic
model of robust correctness. Theoretical Computer
Science, 159(2):245-270, 3 June 1996.
- Eiichi Horita, J. W. de Bakker, and J. J. M. M. Rutten. Fully abstract denotational models
for nonuniform concurrent languages. Information and
Computation, 115(1):125-178, 15 November 1994.
- Sven-Olof Nyström. There is no fully
abstract fixpoint semantics for non-deterministic languages with
infinite computations. Information Processing Letters,
60(6):289-293, 23 December 1996.
- Sven-Olof Nyström and Bengt Jonsson. A fully abstract semantics for
concurrent constraint programming. Information and
Computation, 146(2):138-180, 1 November 1998.
- Prakash Panangaden and Vasant Shanbhogue. The expressive power of
indeterminate dataflow primitives. Information and
Computation, 98(1):99-131, May 1992.
Shortcuts: