Author:
GORLA DANIELE,NESTMANN UWE
Abstract
What does it mean that an encoding is fully abstract? What does itnotmean? In this position paper, we want to help the reader to evaluate the real benefits of using such a notion when studying the expressiveness of programming languages. Several examples and counterexamples are given. In some cases, we work at a very abstract level; in other cases, we give concrete samples taken from the field of process calculi, where the theory of expressiveness has been mostly developed in the last years.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference56 articles.
1. On the expressive power of polyadic synchronisation in π-calculus;Carbone;Nordic Journal of Computing,2003
2. Paterson M. S. and Hewitt C. E. (1970) Comparative schematology. In: Conference on Concurrent Systems and Parallel Computation, ACM 119–127.
3. On the Expressiveness of Chi, Update, and Fusion calculi
4. Testing equivalences for processes
5. Wait-free synchronization
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献