RTA 2000 | Sciweavers

25

click to vote

RTA
2000
Springer

89views Theoretical Computer Science» more RTA 2000»

REM (Reduce Elan Machine): Core of the New ELAN Compiler

14 years 2 months ago

Download www.loria.fr

Pierre-Etienne Moreau

claim paper

Read More »

33

click to vote

RTA
2000
Springer

98views Theoretical Computer Science» more RTA 2000»

Linear Second-Order Unification and Context Unification with Tree-Regular Constraints

14 years 2 months ago

Download www.iiia.csic.es

Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...

Jordi Levy, Mateu Villaret

claim paper

Read More »

43

click to vote

RTA
2000
Springer

111views Theoretical Computer Science» more RTA 2000»

Parallelism Constraints

14 years 2 months ago

Download scidok.sulb.uni-saarland.de

Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...

Katrin Erk, Joachim Niehren

claim paper

Read More »

36

click to vote

RTA
2000
Springer

105views Theoretical Computer Science» more RTA 2000»

Linear Higher-Order Matching Is NP-Complete

14 years 2 months ago

Download www.loria.fr

We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...

Philippe de Groote

claim paper

Read More »

30

click to vote

RTA
2000
Springer

98views Theoretical Computer Science» more RTA 2000»

Termination and Confluence of Higher-Order Rewrite Systems

14 years 2 months ago

Download www-rocq.inria.fr

Frédéric Blanqui

claim paper