Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics

We present a formalism called Addressed Term Rewriting Systems, which can be used to define the operational semantics of programming languages, especially those involving sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, as for instance the family of languages called λOba, involving both functional and object-based features.