PT Journal
AU Piperno, A
Tronci, E
TI Regular Systems of Equations in λ-calculus
SO Int. J. Found. Comput. Sci.
PY 1990
BP 325
EP 340
VL 1
IS 3
DI 10.1142/S0129054190000230
AB Many problems arising in equational theories like Lambda-calculus and Combinatory Logic can be expressed by combinatory equations or systems of equations. However, the solvability problem for an arbitrarily given class of systems is in general undecidable. In this paper we shall focus our attention on a decidable class of systems, which will be called regular systems, and we shall analyse some classical problems and well-known properties of Lambda-calculus that can be described and solved by means of regular systems. The significance of such class will be emphasized showing that for slight extensions of it the solvability problem turns out to be undecidable.
ER