Mathematical Structures in Computer Science · 2014 · 45 citations · 37 references
ComputingComputer ScienceProgramming LanguagesSemanticsTheory Of ComputationAbstract InterpretationData AbstractionFormal Language FoundationsFormal LanguagesFormal SemanticsType SystemsAbstract SemanticsAbstractionAbstraction MechanismsComputational ExpressivenessExpressivenessStructural Abstraction
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.
37
Wojciech Penczek · Science of Computer Programming · 1990 · 4K citations
Maurice Herlihy · ACM Transactions on Programming Languages and Systems · 1991 · 1.8K citations · Full text
Testing equivalences for processes
Rocco De Nicola, Matthew Hennessy · Theoretical Computer Science · 1984 · 1.2K citations
LCF considered as a programming language
Gordon Plotkin · Theoretical Computer Science · 1977 · 1.1K citations
The next 700 programming languages
P. J. Landin · Communications of the ACM · 1966 · 581 citations · Full text