On the Simplification and Equivalence Problems for Straight-Line Programs

Abstract

The sunphficaUon and equivalence problems are examined for several classes of straightline programs. It is shown that the problems are unsolvable for all nontrivlal classes. For example, it is proved that there is no algorithm to determine if an arbRrary program using only the constructs x ,,-1, r , x + y , x ,,-x / y , where x / y ~s integer diwsion with… (More)
DOI: 10.1145/2402.322396

Topics

  • Presentations referencing similar topics