Rational Unification in 28 Characters

Authors:
Pietro Cenciarelli;Alessandro Tiberi
Affiliations:
Dipartimento di Informatica, University of Rome - “La Sapienza”, Italy;Dipartimento di Informatica, University of Rome - “La Sapienza”, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 10
Cited 1

A model for distributed systems based on graph rewriting

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools

Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Term graph rewriting

Handbook of graph grammars and computing by graph transformation
Mobile ambients

Theoretical Computer Science
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed processes and location failures

Theoretical Computer Science
A LTS Semantics of Ambients via Graph Synchronization with Mobility

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Linear unification

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Network Applications of Graph Bisimulation

ICGT '08 Proceedings of the 4th international conference on Graph Transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is efficient, that is quasi-linear, and simple: a program of 28 characters.