Skip to main navigation Skip to search Skip to main content

Context unification and traversal equations

  • CSIC
  • IMA

Research output: Chapter in Book/Conference proceedingConference proceedingpeer-review

8 Citations (Scopus)

Abstract

Context unification was originally denned by H. Comon in ICALP'92, as the problem of finding a unifier for a set of equations containing first-order variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are second-order variables that are restricted to be instantiated by linear terms (a linear term is a λ-expression λx1 ⋯ λxn. t where every xi occurs exactly once in i). In this paper, we prove that, if the so called rank-bound conjecture is true, then the context unification problem is decidable. This is done reducing context unification to solvability of traversal equations (a kind of word unification modulo certain permutations) and then, reducing traversal equations to word equations with regular constraints.

Original languageEnglish
Title of host publicationRewriting Techniques and Applications - 12th International Conference, RTA 2001, Proceedings
EditorsAart Middeldorp
PublisherSpringer Verlag
Pages169-184
Number of pages16
ISBN (Print)3540421173, 9783540421177
DOIs
Publication statusPublished - 2001
Externally publishedYes
Event12th International Conference on Rewriting Techniques and Applications, RTA 2001 - Utrecht, Netherlands
Duration: 22 May 200124 May 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2051 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Rewriting Techniques and Applications, RTA 2001
Country/TerritoryNetherlands
CityUtrecht
Period22/05/0124/05/01

Fingerprint

Dive into the research topics of 'Context unification and traversal equations'. Together they form a unique fingerprint.

Cite this