Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-6443
Main Title: Full abstraction for expressiveness: history, myths and facts
Author(s): Gorla, Daniele
Nestmann, Uwe
Type: Article
Language Code: en
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.
URI: https://depositonce.tu-berlin.de//handle/11303/7168
http://dx.doi.org/10.14279/depositonce-6443
Issue Date: 2014
Date Available: 23-Nov-2017
DDC Class: 004 Informatik
Usage rights: Terms of German Copyright Law
Journal Title: Mathematical structures in computer science
Publisher: Cambridge University Press
Publisher Place: Cambridge
Volume: 26
Issue: 4
Publisher DOI: 10.1017/s0960129514000279
Page Start: 639
Page End: 654
EISSN: 1469-8072
ISSN: 0960-1295
Notes: Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.
This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.
Appears in Collections:Fachgebiet Modelle und Theorie Verteilter Systeme » Publications

Files in This Item:
File Description SizeFormat 
full_abstraction_for_expressiveness_history_myths_and_facts.pdf160.63 kBAdobe PDFThumbnail
View/Open


Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.