Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics

Authors:
Dan Dougherty;Pierre Lescanne;Luigi Liquori;Frédéric Lang
Affiliations:
Worcester Polytechnic Institute, Worcester, MA, U.S.A.;École Normale Supérieure, Lyon, France;INRIA Sophia Antipolis, France;INRIA Rhone-Alpes, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 16
Cited 6

Term graph rewriting

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
A syntactic theory of sequential state

Theoretical Computer Science
Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term graph rewriting: theory and practice

Term graph rewriting: theory and practice
A call-by-need lambda calculus

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Properties of a first-order functional language with sharing

Theoretical Computer Science
Term rewriting and all that

Term rewriting and all that
A lambda calculus of objects with self-inflicted extension

Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Featherweight Java: a minimal core calculus for Java and GJ

ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of Theoretical Computer Science

Handbook of Theoretical Computer Science
A Theory of Objects

A Theory of Objects
Functional Programming and Parallel Graph Rewriting

Functional Programming and Parallel Graph Rewriting
The Definition of Standard ML

The Definition of Standard ML
A lambda calculus of objects and method specialization

Nordic Journal of Computing
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution

PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
A compiler for lazy ML

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming

Rewriting term-graphs with priority

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Addressed term rewriting systems: application to a typed object calculus

Mathematical Structures in Computer Science
Modeling Pointer Redirection as Cyclic Term-graph Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Compilation of extended recursion in call-by-value functional languages

Higher-Order and Symbolic Computation
Optimality for dynamic patterns

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
A unified approach to fully lazy sharing

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 @lOb?^a, involving both functional and object-based features.