Regular Systems of Equations in λ-calculus
Piperno
Adolfo
author
Tronci
Enrico
author
1990
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.
exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=60), last updated on Wed, 05 Oct 2016 12:42:23 +0200
text
http://mclab.di.uniroma1.it/publications/papers/piperno/1990/60_Piperno+Tronci1990.pdf
10.1142/S0129054190000230
Piperno+Tronci1990
Sapienza @ mari @ ijfcs90
Int. J. Found. Comput. Sci.
1990
continuing
periodical
academic journal
1
3
325
340