Separating concurrent languages with categories of language embeddings (1991)

Cached

Download Links

by Ehud Shapiro
Venue:In Proceedings of the 23 rd Annual ACM Symposium on Theory of Computing
Citations:11 - 1 self

Documents Related by Co-Citation

132 On the Expressive Power of Programming Languages – Matthias Felleisen - 1990
12 Embeddings among concurrent programming languages – E Shapiro - 1992
3219 Communication and Concurrency – R Milner - 1990
32 Embedding as a tool for Language Comparison – Frank S. de Boer, Catuscia Palamidessi, Catuscia Palamidessi - 1994
22 Fully abstract translations between functional languages – J G Riecke - 1991
83 Impossibility and universality results for wait–free synchronization – Maurice Herlihy - 1988
11 Embedding as a tool for Language Comparison: On the CSP hierarchy – Frank S. de Boer, Frank S. De Boer, Catuscia Palamidessi, Catuscia Palamidessi - 1991
129 Logic semantics for a class of committed-choice programs – Michael J Maher - 1987
269 The family of concurrent logic programming languages – E Shapiro - 1989
1330 A Calculus of Communicating Systems – R Milner - 1980
38 On abstraction and the expressive power of programming languages – J C Mitchell - 1993
37 Lambda - The Ultimate Imperative – Guy Steele, Gerald Sussman - 1976
180 The next 700 programming languages – P J Landin - 1966
75 Parametric Polymorphism and Operational Equivalence – Andrew M. Pitts - 2000
110 Fully abstract models of typed lambda calculi – R Milner - 1977
26 Testing equivalences for processes. Theoret – R De Nicola, M Hennessy - 1984
14 A non-deterministic call-by-need lambda calculus – Arne Kutzner, Manfred Schmidt-Schauß - 1998
11 Must Preorder in Non-Deterministic Untyped λ-calculus – U. de'Liguoro, A. Piperno - 1992
5 A fully abstract translation between a lambda-calculus with reference types and – E Ritter, A M Pitts - 1995