20
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Full abstraction for expressiveness: history, myths and facts

      ,
      Mathematical Structures in Computer Science
      Cambridge University Press (CUP)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

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

          Related collections

          Most cited references41

          • Record: found
          • Abstract: not found
          • Article: not found

          Wait-free synchronization

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            LCF considered as a programming language

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Barbed bisimulation

                Bookmark

                Author and article information

                Journal
                Mathematical Structures in Computer Science
                Math. Struct. Comp. Sci.
                Cambridge University Press (CUP)
                0960-1295
                1469-8072
                May 2016
                November 13 2014
                May 2016
                : 26
                : 4
                : 639-654
                Article
                10.1017/S0960129514000279
                22784ea8-6d53-41a2-b686-70c10a47d273
                © 2016

                https://www.cambridge.org/core/terms

                History

                Comments

                Comment on this article