Full abstraction for expressiveness: history, myths and facts

Daniele Gorla, Uwe Nestmann

Mathematical Structures in Computer Science · 2014 · 45 citations · 37 references

Concepts

Abstract

What does it mean that an encoding is fully abstract? What does it not mean? 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.

References

37