RTA 1998 | Sciweavers

There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...

Jordi Levy

claim paper

Read More »

31

click to vote

RTA
1998
Springer

83views Theoretical Computer Science» more RTA 1998»

An On-line Problem Database

14 years 4 months ago

Download www.math.tau.ac.il

Nachum Dershowitz, Ralf Treinen

claim paper

Read More »

35

click to vote

RTA
1998
Springer

115views Theoretical Computer Science» more RTA 1998»

The Decidability of Simultaneous Rigid E-Unification with One Variable

14 years 4 months ago

Download research.microsoft.com

We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...

Anatoli Degtyarev, Yuri Gurevich, Paliath Narendra...

claim paper

Read More »

33

click to vote

RTA
1998
Springer

68views Theoretical Computer Science» more RTA 1998»

Higher-Order Rewriting and Partial Evaluation

14 years 4 months ago

Download www.brics.dk

Olivier Danvy, Kristoffer Høgsbro Rose

claim paper