Selected papers that cite this one
- H. P. Barendregt, J. R. Kennaway, J. W. Klop, and M. R. Sleep. Needed reduction and spine strategies for the lambda calculus. Information and Computation, 75(3):191-231, December 1987.
- Gérard Boudol and Ilaria Castellani. Flow models of distributed computations: Three equivalent semantics for CCS. Information and Computation, 114(2):247-314, 1 November 1994.
- Felipe Bracho, Manfred Droste, and Dietrich Kuske. Representation of computations in concurrent automata by dependence orders. Theoretical Computer Science, 174(1-2):67-96, 15 March 1997.
- Stephen Brookes. Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin. Theoretical Computer Science, 121(1-2):179-186, 6 December 1993.
- Pierre-Louis Curien, Thérèse Hardin, and Jean-Jacques Lévy. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43(2):362-397, March 1996.
- Manfred Droste. Aperiodic languages in concurrency monoids. Information and Computation, 126(2):105-113, 1 May 1996.
- Björn Lisper. Total unfolding: theory and applications. Journal of Functional Programming, 4(4):479-498, October 1994.