Full Abstraction for a Simple Parallel Programming Language (1979)

by M. C. B. Hennessy , G. D. Plotkin
Venue:LNCS
Citations:90 - 16 self

Documents Related by Co-Citation

210 A powerdomain construction – G. D. Plotkin - 1976
1323 A Calculus of Communicating Systems – R Milner
730 Notions of Computation and Monads – Eugenio Moggi - 1991
120 A domain equation for bisimulation – S Abramsky - 1991
136 Probabilistic Non-determinism – C Jones - 1990
1280 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
1194 The temporal logic of programs – A Pnueli - 1977
125 A probabilistic powerdomain of evaluations – C Jones, G D Plotkin - 1989
163 An abstract view of programming languages – E Moggi - 1989
378 BASIC CONCEPTS OF ENRICHED CATEGORY THEORY – G. M. Kelly - 2005
169 The Category-Theoretic Solution of Recursive Domain Equations – M B Smyth, G D Plotkin - 1982
22 Probabilistic Domains – Reinhold Heckmann - 1997
436 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
392 Algebraic Theory of Processes – M Hennessy - 1988
394 LCF considered as a programming language – G D Plotkin - 1977
162 A nal coalgebra theorem – P Aczel, N Mendler - 1989
654 Concurrency and automata on infinite sequences – D Park - 1981
37 A Coinduction Principle for Recursive Data Types Based on Bisimulation – Marcelo P. Fiore - 1996
40 A Co-induction Principle for Recursively Defined Domains – Andrew M. Pitts - 1992